PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS

DOI10.1142/S0129054111007952zbMath1213.68344OpenAlexW1972044370MaRDI QIDQ3076613

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

Publication date: 23 February 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111007952

zbMATH Keywords

descriptional complexitydistributed problem solvingparallel communicating grammar systemsclusters of agents

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

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

Cites Work

• Unnamed Item
• On the computational completeness of context-free parallel communicating grammar systems
• PC grammar systems with five context-free components generate all recursively enumerable languages.
• Turing machines with restricted memory access

This page was built for publication: PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS