Nonreturning PC grammar systems can be simulated by returning systems

DOI10.1016/0304-3975(95)00258-8zbMath0872.68099OpenAlexW1977952029MaRDI QIDQ671531

Sorina Dumitrescu

Publication date: 27 February 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00258-8

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Parallel communicating grammar systems with context-free components are Turing complete for any communication model, On the power of parallel communicating grammar systems with right-linear components, Parallel communicating limited and uniformly limited 0L systems, Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts, On simulating non-returning PC grammar systems with returning systems, On the computational power of context-free PC grammar systems, On the computational completeness of context-free parallel communicating grammar systems

Cites Work

• Parallel communicating grammar systems: the context-sensitive case
• On the power of parallel communicating grammar systems with right-linear components
• Two lower bounds on distributive generation of languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item