On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms

DOI10.1016/S0304-3975(99)00318-7zbMath0973.68096OpenAlexW1975304101MaRDI QIDQ5941084

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

Publication date: 20 August 2001

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00318-7

zbMATH Keywords

context-free returning parallel communicating grammar systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (3)

Unnamed Item ⋮ Using Graph Grammar Systems with Memory in Computer Aided Design ⋮ Parallel communicating grammar systems with bounded resources

Cites Work

• On the computational completeness of context-free parallel communicating grammar systems
• On the synchronization in parallel communicating grammar systems
• Some decision problems for parallel communicating grammar systems
• On the computational power of context-free PC grammar systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms