Parallel communicating grammar systems with bounded resources

DOI10.1016/S0304-3975(01)00172-4zbMath1002.68078OpenAlexW2064968540MaRDI QIDQ1605310

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

Publication date: 15 July 2002

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00172-4

zbMATH Keywords

size complexitygrammar systemsrecursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (1)

PC grammar systems with five context-free components generate all recursively enumerable languages.

Cites Work

• On the computational completeness of context-free parallel communicating grammar systems
• On the power of parallel communicating grammar systems with right-linear components
• On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Parallel communicating grammar systems with bounded resources