Indexed Languages and Unification Grammars
Tore Burheim · arXiv (Cornell University) · 1995
Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.