On permutative grammars generating context-free languages

DOI10.1007/BF01936139zbMath0582.68045MaRDI QIDQ1068558

Erkki Maekinen

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

label languagesSzilard languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Well-structured transition systems everywhere! ⋮ On the Membership Problem of Permutation Grammars — A Direct Proof of NP-Completeness

Cites Work

• Unnamed Item
• A general class of noncontext free grammars generating context free languages
• A normal form theorem for label grammars
• Non-context-free grammars generating context-free languages
• Associate languages and derivational complexity of formal grammars and languages
• On the structure of context-sensitive grammars