On the index of a context-free grammar and language
From MaRDI portal
Publication:5571706
DOI10.1016/S0019-9958(69)90164-8zbMath0181.31001MaRDI QIDQ5571706
Publication date: 1969
Published in: Information and Control (Search for Journal in Brave)
Related Items (20)
Unnamed Item ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ An infinite pebble game and applications ⋮ On the degree of non-regularity of context-free languages ⋮ Unnamed Item ⋮ The emptiness problem for valence automata over graph monoids ⋮ On the splicing operation ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ Unnamed Item ⋮ Newton’s Method for ω-Continuous Semirings ⋮ A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS ⋮ On the index of positive programmed formal languages ⋮ Context-free grammar forms ⋮ Grammarforms and grammarhomomorphisms ⋮ On the generative capacity of context-free matrix forms ⋮ On the family of finite index matrix languages ⋮ Outils et résultats pour les transducteurs boustrophédons ⋮ On strongly context-free languages ⋮ Langages à un compteur ⋮ Theory of formal grammars
This page was built for publication: On the index of a context-free grammar and language
