Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)

DOI10.1016/S0304-3975(02)00541-8zbMath1051.68087MaRDI QIDQ1874414

Markus Holzer, Rudolf Freund, Henning Fernau

Publication date: 25 May 2003

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

zbMATH Keywords

Programmed grammarsGrammar systemsHybrid modesOrdered grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

Cooperating Distributed Tree Automata ⋮ A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems ⋮ Unnamed Item ⋮ On the Expressive Power of Valences in Cooperating Distributed Grammar Systems ⋮ The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems ⋮ DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS

Cites Work

• On a hierarchy of languages generated by cooperating distributed grammar systems
• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
• Unconditional transfer in regulated rewriting
• On ETOL systems of finite index
• On the effect of the finite index restriction on several families of grammars
• Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
• 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: Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\)