The following pages link to (Q4452052):
Displaying 24 items.
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← 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)
- On determinism versus nondeterminism for restarting automata (Q948093) (← links)
- Two-dimensional hierarchies of proper languages of lexicalized FRR-automata (Q1041046) (← links)
- On special forms of restarting automata (Q1592926) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Restarting automata, Church-Rosser languages, and representations of {r. e. \ }languages (Q2708956) (← links)
- On the classes of languages accepted by limited context restarting automata (Q2877374) (← links)
- Restarting Automata with Auxiliary Symbols and Small Lookahead (Q3004608) (← links)
- (Q3442616) (← links)
- Restarting Tree Automata and Linear Context-Free Tree Languages (Q3522874) (← links)
- (Q4531378) (← links)
- (Q5016372) (← links)
- Decidability Questions for Insertion Systems and Related Models (Q5164868) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
- Binding-blocking automata (Q5416433) (← links)
- Sequential monotonicity for restarting automata (Q5441545) (← links)
- Restarting Tree Automata (Q5448801) (← links)
- On properties of languages accepted by deterministic pushdown automata with translucent input letters (Q6666799) (← links)
