The following pages link to (Q5554980):
Displayed 17 items.
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- An alternating hierarchy for finite automata (Q442279) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states (Q1400001) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- Descriptional Complexity of the Forever Operator (Q5384434) (← links)
- Binary coded unary regular languages (Q6199860) (← links)