Abstract

Ve prove in this paper that unordered, or ID/LP grarnma, are exponentially more succinct than context- free grammars, by exhibiting a sequence (L,) of finite languages such that the size of any CFG for L, must grow exponentially in n, but which can be described by polynomial-size ID/LP grammars. The results have implications for the description of free word order languages. 2

Citations