Uniform rewriting based on permutations

DOI10.1080/00207169808804709zbMath0901.68103OpenAlexW2052348107MaRDI QIDQ4208597

Alexander Meduna

Publication date: 7 September 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804709

zbMATH Keywords

phrase-structure grammarEIL systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS ⋮ ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS ⋮ Homogeneous grammars with a reduced number of non-context-free products

Cites Work

• Unnamed Item
• Tree controlled grammars
• Context free derivations on word monoids
• Syntactic complexity of context-free grammars over word monoids

This page was built for publication: Uniform rewriting based on permutations