Nonreturning PC grammar systems can be simulated by returning systems
From MaRDI portal
(Redirected from Publication:671531)
Recommendations
Cites work
- scientific article; zbMATH DE number 23841 (Why is no real title available?)
- scientific article; zbMATH DE number 745858 (Why is no real title available?)
- scientific article; zbMATH DE number 878951 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- On the power of parallel communicating grammar systems with right-linear components
- Parallel communicating grammar systems: the context-sensitive case
- The computational complexity of PCGS with regular components
- Two lower bounds on distributive generation of languages
Cited in
(7)- On the computational completeness of context-free parallel communicating grammar systems
- Parallel communicating limited and uniformly limited 0L systems
- On the computational power of context-free PC 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 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
- On simulating non-returning PC grammar systems with returning systems
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)
