Complexity and unambiguity of context-free grammars and languages
From MaRDI portal
Publication:5649430
DOI10.1016/S0019-9958(71)90519-5zbMath0238.68022MaRDI QIDQ5649430
Publication date: 1971
Published in: Information and Control (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
Unnamed Item, Unnamed Item, On bounded interpretations of grammar forms, Concise description of finite languages, Classes of formal grammars, On the cover complexity of finite languages, Unnamed Item, On reducing the number of states in a PDA