Pages that link to "Item:Q671531"
From MaRDI portal
The following pages link to Nonreturning PC grammar systems can be simulated by returning systems (Q671531):
Displaying 7 items.
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model (Q508542) (← links)
- On simulating non-returning PC grammar systems with returning systems (Q1274932) (← links)
- On the computational completeness of context-free parallel communicating grammar systems (Q1287096) (← links)
- On the computational power of context-free PC grammar systems (Q1566712) (← links)
- On the power of parallel communicating grammar systems with right-linear components (Q4380555) (← links)
- Emergence in Context-Free Parallel Communicating Grammar Systems: What Does and Does not Make a Grammar System More Expressive Than Its Parts (Q4686650) (← links)
- Parallel communicating limited and uniformly limited 0L systems (Q5941068) (← links)
