Complexity and unambiguity of context-free grammars and languages

DOI10.1016/S0019-9958(71)90519-5zbMath0238.68022MaRDI QIDQ5649430

Jozef Gruska

Publication date: 1971

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Unnamed Item ⋮ Unnamed Item ⋮ Concise description of finite languages ⋮ Unnamed Item ⋮ Classes of formal grammars ⋮ On the cover complexity of finite languages ⋮ On reducing the number of states in a PDA ⋮ On bounded interpretations of grammar forms

This page was built for publication: Complexity and unambiguity of context-free grammars and languages