Pages that link to "Item:Q1212799"
From MaRDI portal
The following pages link to A geometric hierarchy of languages (Q1212799):
Displaying 21 items.
- Basic tree transducers (Q579951) (← links)
- Linear indexed languages (Q797293) (← links)
- On input-revolving deterministic and nondeterministic finite automata (Q1041031) (← links)
- The OI-hierarchy is closed under control (Q1109578) (← links)
- Tree transducers, L systems, and two-way machines (Q1136239) (← links)
- Upper bounds on recognition of a hierarchy of non-context-free languages (Q1193884) (← links)
- A geometric hierarchy beyond context-free languages (Q1200806) (← links)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Multipass precedence analysis (Q1393278) (← links)
- Global index grammars and descriptive power (Q1770832) (← links)
- Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- Storage products and linear control of derivations (Q2480751) (← links)
- DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS (Q3401481) (← links)
- HYBRID EXTENDED FINITE AUTOMATA (Q3503090) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
- (Q4168079) (← links)
- The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
- Pumping lemmas for the control language hierarchy (Q4835863) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)