한국언어정보학회지:언어와정보 (Language and Information)
- 제5권2호
- /
- Pages.1-8
- /
- 2001
- /
- 1226-7430(pISSN)
Why Korean Is Not a Regular Language: A Proof
초록
Natural language string sets are known to require a grammar with a generative capacity slightly beyond that of Context Free Grammars. Proofs regarding complexity of natural language have involved particular properties of languages like English, Swiss German and Bambara. While it is not very difficult to prove that Korean is more complex than the simplest of the many infinite sets, no proof has been given of this in the literature. I identify two types of center embedding in Korean and use them in proving that Korean is not a regular set, i.e. that no FSA's can recognize its string set. The regular language i salam i (i salam ul
키워드