Pages that link to "Item:Q2548174"
From MaRDI portal
The following pages link to Time-bounded grammars and their languages (Q2548174):
Displayed 19 items.
- Membership for growing context-sensitive grammars is polynomial (Q579948) (← links)
- Grammars with valuations - a discrete model for self-organization of biopolymers (Q1164435) (← links)
- Nonuniform complexity and the randomness of certain complete languages (Q1184988) (← links)
- On the complexity of formal grammars (Q1239000) (← links)
- The ancestor width of grammars and languages (Q1274983) (← links)
- Deterministic multitape automata computations (Q1393939) (← links)
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages (Q1776398) (← links)
- Time and space complexity for splicing systems (Q1959375) (← links)
- On the degrees of non-regularity and non-context-freeness (Q2009649) (← links)
- On the synchronized derivation depth of context-free grammars (Q2271456) (← links)
- Complexity theory for splicing systems (Q2455600) (← links)
- On the extension of Gladkij's theorem and the hierarchies of languages (Q2557560) (← links)
- A TREE-HEIGHT HIERARCHY OF CONTEXT-FREE LANGUAGES (Q3401487) (← links)
- SHRINKING RESTARTING AUTOMATA (Q3434280) (← links)
- Time-bounded controlled bidirectional grammars (Q3477981) (← links)
- On the generating power of regularly controlled bidirectional grammars (Q3979697) (← links)
- Some restrictions onW-grammars (Q4776853) (← links)
- On the structure of context-sensitive grammars (Q5683718) (← links)
- Sweeping input-driven pushdown automata (Q6199874) (← links)