On a hierarchy of languages generated by cooperating distributed grammar systems

DOI10.1016/S0020-0190(98)00200-2zbMath1339.68142OpenAlexW1994435285MaRDI QIDQ294612

Henning Bordihn, Markus Holzer

Publication date: 16 June 2016

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00200-2

zbMATH Keywords

distributed systemsformal languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (2)

Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\) ⋮ The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems

Cites Work

• Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a hierarchy of languages generated by cooperating distributed grammar systems