Nonreturning PC grammar systems can be simulated by returning systems
From MaRDI portal
Publication:671531
DOI10.1016/0304-3975(95)00258-8zbMATH Open0872.68099OpenAlexW1977952029MaRDI QIDQ671531FDOQ671531
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two lower bounds on distributive generation of languages
- Parallel communicating grammar systems: the context-sensitive case
- On the power of parallel communicating grammar systems with right-linear components
- Title not available (Why is that?)
- The computational complexity of PCGS with regular components
Cited In (7)
- On the computational completeness of context-free parallel communicating grammar systems
- Emergence in context-free parallel communicating grammar systems: what does and does not make a grammar system more expressive than its parts
- On the computational power of context-free PC grammar systems
- Parallel communicating limited and uniformly limited 0L systems
- On simulating non-returning PC grammar systems with returning systems
- On the power of parallel communicating grammar systems with right-linear components
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model
This page was built for publication: Nonreturning PC grammar systems can be simulated by returning systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671531)
