On the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems

DOI10.1007/978-3-642-22600-7_10zbMath1341.68070OpenAlexW187414694MaRDI QIDQ5200086

György Vaszil, Erzsébet Csuhaj-Varjú

Publication date: 29 July 2011

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22600-7_10

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts

Cites Work

• Prescribed teams of grammars
• PC grammar systems with five context-free components generate all recursively enumerable languages.
• PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS
• DYNAMICALLY FORMED CLUSTERS OF AGENTS IN ECO-GRAMMAR SYSTEMS
• Teams in cooperating grammar systems
• Turing machines with restricted memory access
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item