The following pages link to (Q2708956):
Displaying 12 items.
- Restarting automata with restricted utilization of auxiliary symbols (Q860860) (← 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)
- Parikh-reducing Church-Rosser representations for some classes of regular languages (Q1676318) (← links)
- Weighted restarting automata (Q1797778) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- On Restarting Automata with Window Size One (Q5200077) (← links)
- Restarting automata with auxiliary symbols restricted by lookahead size (Q5248075) (← links)
- A hierarchy of jumping restarting automata (Q6180004) (← links)
