The following pages link to (Q4934755):
Displayed 16 items.
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages (Q840776) (← links)
- Restarting automata with restricted utilization of auxiliary symbols (Q860860) (← links)
- Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata (Q860892) (← links)
- Degrees of non-monotonicity for restarting automata (Q861249) (← links)
- On the complexity of 2-monotone restarting automata (Q927391) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- Sorted dependency insertion grammars (Q2368947) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- Hierarchies of weakly monotone restarting automata (Q3025320) (← links)
- Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (Q3073635) (← links)
- A Measure for the Degree of Nondeterminism of Context-Free Languages (Q3503906) (← links)
- On Restarting Automata with Window Size One (Q5200077) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
- Sequential monotonicity for restarting automata (Q5441545) (← links)