An analog of a theorem about context-free languages
From MaRDI portal
Publication:5575567
DOI10.1016/S0019-9958(67)90771-1zbMath0184.02601MaRDI QIDQ5575567
Publication date: 1967
Published in: Information and Control (Search for Journal in Brave)
Related Items (20)
On Grammars Controlled by Parikh Vectors ⋮ Unnamed Item ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ Weightreducing grammars and ultralinear languages ⋮ Unnamed Item ⋮ On the degree of non-regularity of context-free languages ⋮ Unnamed Item ⋮ On the splicing operation ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Unnamed Item ⋮ A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS ⋮ On the degrees of non-regularity and non-context-freeness ⋮ One counter languages and the IRS condition ⋮ On the generative capacity of simple matrix grammars of finite index ⋮ On the generative capacity of tree controlled grammars ⋮ On the family of finite index matrix languages ⋮ A hierarchy between context-free and context-sensitive languages ⋮ Outils et résultats pour les transducteurs boustrophédons ⋮ Theory of formal grammars ⋮ Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981
This page was built for publication: An analog of a theorem about context-free languages
