On ambiguity in EOL systems

DOI10.1016/0304-3975(80)90025-0zbMath0452.68076OpenAlexW1979048127MaRDI QIDQ1148689

Grzegorz Rozenberg, Andrzej Ehrenfeucht

Publication date: 1980

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(80)90025-0

zbMATH Keywords

context-free grammarsLindenmayer systemsparallel rewritingsequential rewriting

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

EDT0L grammars with only one variable have tractable generating functions ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity ⋮ On inherently ambiguous E0L languages

Cites Work

• Unnamed Item
• Unnamed Item
• Synchronized EOL forms
• Ambiguity in the developmental systems of Lindenmayer
• On Context-Free Languages

This page was built for publication: On ambiguity in EOL systems