The following pages link to (Q4531378):
Displayed 13 items.
- Weighted restarting automata and pushdown relations (Q287429) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (Q2914714) (← links)
- (Q5016372) (← links)
- On restarting automata with auxiliary symbols and small window size (Q5021113) (← links)
- (Q5061521) (← links)
- On Restarting Automata with Window Size One (Q5200077) (← links)
- One-Way Restarting Automata and Their Sensitivitys (Q6114874) (← links)
- Non-returning deterministic and nondeterministic finite automata with translucent letters (Q6186539) (← links)
- (Q6190439) (← links)
- A survey on automata with translucent letters (Q6199861) (← links)