A three-restricted normal form theorem for ETOL languages

DOI10.1016/0020-0190(82)90061-8zbMath0483.68068OpenAlexW2094987359MaRDI QIDQ1163380

Takashi Yokomori, Klaus-Joern Lange, Derick Wood

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90061-8

zbMATH Keywords

L systemsparallel rewritingETOL systemsk-restriction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (7)

Active symbols in grammars with valuations ⋮ Restriction of active symbols in k-limited etol systems and a normal form theorem ⋮ On the number of active states in deterministic and nondeterministic finite automata ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ ON THE DESCRIPTIONAL COMPLEXITY OF LINDENMAYER SYSTEMS ⋮ On the number of active states in finite automata ⋮ ON THE NUMBER OF ACTIVE SYMBOLS IN LINDENMAYER SYSTEMS

Cites Work

• Unnamed Item
• A study in parallel rewriting systems

This page was built for publication: A three-restricted normal form theorem for ETOL languages