scientific article; zbMATH DE number 3269886
From MaRDI portal
Publication:5554980
Cited in
(19)- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Descriptional complexity of regular languages
- Oblivious two-way finite automata: decidability and complexity
- More on deterministic and nondeterministic finite cover automata
- Magic numbers in the state hierarchy of finite automata
- Operations on Unambiguous Finite Automata
- More on deterministic and nondeterministic finite cover automata (extended abstract)
- Translation from classical two-way automata to pebble two-way automata
- Nondeterministic state complexity of star-free languages
- An alternating hierarchy for finite automata
- On a structural property in the state complexity of projected regular languages
- On the size of two-way reasonable automata for the liveness problem
- Operations on Unambiguous Finite Automata
- State complexity of projected languages
- Descriptional complexity of the forever operator
- Optimal simulation of self-verifying automata by deterministic automata
- Binary coded unary regular languages
- Converting binary automata to unary automata
- Binary coded unary regular languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554980)
