The following pages link to Control sets on linear grammars (Q4053132):
Displaying 14 items.
- Basic tree transducers (Q579951) (← 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)
- Control sets on context-free grammar forms (Q1238638) (← links)
- One way finite visit automata (Q1242687) (← links)
- Multipass precedence analysis (Q1393278) (← links)
- Even linear simple matrix languages: formal language properties and grammatical inference. (Q1853536) (← links)
- Weighted parsing for grammar-based language models over multioperator monoids (Q2051800) (← links)
- Weighted iterated linear control (Q2422779) (← links)
- HYBRID EXTENDED FINITE AUTOMATA (Q3503090) (← links)
- Iterated linear control and iterated one-turn pushdowns (Q3776663) (← links)
- (Q4168079) (← links)
- Gaining Power by Input Operations: Finite Automata and Beyond (Q5200048) (← links)
