Pages that link to "Item:Q1072714"
From MaRDI portal
The following pages link to A variant of random context grammars: Semi-conditional grammars (Q1072714):
Displayed 22 items.
- On restricted context-free grammars (Q414885) (← links)
- Reaction automata (Q418799) (← links)
- One-sided random context grammars (Q766166) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- A note on the descriptional complexity of semi-conditional grammars (Q990095) (← links)
- On the power of cooperation: A regular representation of recursively enumerable languages (Q1176482) (← links)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions (Q1763724) (← links)
- Dynamically controlled cooperating/distributed grammar systems (Q1803860) (← links)
- Simple restriction in context-free rewriting (Q1959430) (← links)
- On the computing powers of \(\mathcal{L}\)-reductions of insertion languages (Q1998879) (← links)
- Generalized forbidding matrix grammars and their membrane computing perspective (Q2055827) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- Descriptional complexity of semi-conditional grammars (Q2379990) (← links)
- Generalized forbidding grammars (Q3479537) (← links)
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (Q3618613) (← links)
- On context-free rewriting with a simple restriction and its computational completeness (Q3625698) (← links)
- On grammars with local and global context conditions (Q4323411) (← links)
- Accepting grammars with regulation (Q4844589) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Fuzzy state grammar and fuzzy deep pushdown automaton (Q5273403) (← links)
- A Pumping Lemma for Permitting Semi-Conditional Languages (Q5384432) (← links)
- Single semi-contextual insertion-deletion systems (Q6095514) (← links)