Pages that link to "Item:Q1874424"
From MaRDI portal
The following pages link to PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424):
Displaying 6 items.
- Parallel communicating grammar systems with context-free components are Turing complete for any communication model (Q508542) (← links)
- PC GRAMMAR SYSTEMS WITH CLUSTERS OF COMPONENTS (Q3076613) (← links)
- REMARKS ON CONTEXT-FREE PARALLEL COMMUNICATING GRAMMAR SYSTEMS GENERATING CROSSED AGREEMENTS (Q3526541) (← 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 the Number of Components and Clusters of Non-returning Parallel Communicating Grammar Systems (Q5200086) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
