Some decision problems for parallel communicating grammar systems

DOI10.1016/0304-3975(94)90243-7zbMath0938.68688OpenAlexW2052391311MaRDI QIDQ1341721

Octavian Procopiuc, Cecilia Magdalena Ionescu, Cristian Ene, Ferucio Laurenţiu Ţiplea

Publication date: 15 June 2000

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90243-7

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

On some derivation mechanisms and the complexity of their Szilard languages ⋮ On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Modular supervisory control of discrete-event systems
• Parallel program schemata
• Systolic trellis automatat†
• On the generative capacity of parallel communicating grammar systems
• Parallel communicating grammar systems: the context-sensitive case