On context-free and Szilard languages

DOI10.1007/BF01937483zbMath0541.68046MaRDI QIDQ794440

Erkki Maekinen

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

pumpingcontext-free languagescontext-free grammarsemilinearityParikh mappingSokolowski's criterionSzilard language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2, On homomorphic images of szilard languages, On some derivation mechanisms and the complexity of their Szilard languages, On the Complexity of Szilard Languages of Regulated Grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the sufficiency of Sokolowski's criterion for context-free languages
• A strong pumping lemma for context-free languages
• A method for proving programming languages non context-free
• A Generalization of Ogden's Lemma
• Pumping languages^†
• On Context-Free Languages
• A helpful result for proving inherent ambiguity
• Associate languages and derivational complexity of formal grammars and languages