Pages that link to "Item:Q1287096"
From MaRDI portal
The following pages link to On the computational completeness of context-free parallel communicating grammar systems (Q1287096):
Displaying 7 items.
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model (Q508542) (← links)
- Computing with membranes (Q1582013) (← links)
- Parallel communicating grammar systems with bounded resources (Q1605310) (← links)
- PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424) (← links)
- PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS (Q3076613) (← 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)
- On context-free parallel communicating grammar systems: Synchronization, communication, and normal forms (Q5941084) (← links)
