The following pages link to (Q5586371):
Displaying 10 items.
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Unary finite automata vs. arithmetic progressions (Q989556) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Wielandt-type bounds for primitive mappings of partially ordered sets (Q1812633) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- Determination of systems of graphs and the synthesis of finite automata (Q2527827) (← links)
- Magic Numbers and Ternary Alphabet (Q3637234) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
