Comparison of basic language generating devices (non-deterministic systems)

DOI10.1051/ita/1990240504891zbMath0704.68063OpenAlexW135037602MaRDI QIDQ3484359

Manfred Kudlek

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92371

zbMATH Keywords

rewriting systemsLindenmayer systemsregular systemssemi-Thue systemsIndian parallel systemsgenerative devices

Mathematics Subject Classification ID

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

Cites Work

• Homomorphic images of sentential form languages defined by semi-Thue systems
• Nonterminals, homomorphisms and codings in different variations of OL- systems. II: Nondeterministic systems
• Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems
• Nonterminals, homomorphisms and codings in different variations of OL- systems. I: Deterministic systems
• Context free normal systems and ETOL systems
• A study in parallel rewriting systems
• Pure grammars
• Pure grammars and pure languages†
• Parallel context-free languages
• Parallel context-free languages
• Regular canonical systems
• Formal Reductions of the General Combinatorial Decision Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Comparison of basic language generating devices (non-deterministic systems)