Note on minimal finite automata
From MaRDI portal
Recommendations
- Deterministic blow-ups of minimal NFA's
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- A family of NFA's which need 2ⁿ- deterministic states
Cited in
(31)- Inherently nonplanar automata
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- Finite nondeterministic automata: simulation and minimality
- Descriptional complexity of regular languages
- Magic numbers in the state hierarchy of finite automata
- On continuous nondeterminism and state minimality
- The minimal automaton recognizing m N in a linear numeration system
- scientific article; zbMATH DE number 4201643 (Why is no real title available?)
- Concatenation of Regular Languages and Descriptional Complexity
- Deterministic blow-ups of minimal NFA's
- On the State Complexity of Complements, Stars, and Reversals of Regular Languages
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET
- Automata with Extremal Minimality Conditions
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- Magic Numbers and Ternary Alphabet
- scientific article; zbMATH DE number 3956447 (Why is no real title available?)
- scientific article; zbMATH DE number 4108164 (Why is no real title available?)
- scientific article; zbMATH DE number 4108165 (Why is no real title available?)
- scientific article; zbMATH DE number 58314 (Why is no real title available?)
- scientific article; zbMATH DE number 1949657 (Why is no real title available?)
- On a structural property in the state complexity of projected regular languages
- A family of NFA's which need 2ⁿ- deterministic states
- On a conjecture by Christian Choffrut
- scientific article; zbMATH DE number 1372650 (Why is no real title available?)
- On constructing minimal deterministic finite automaton recognizing a prefix-code of a given cardinality
- On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality
- State complexity of projected languages
- Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet
- IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
- Concatenation of regular languages and descriptional complexity
This page was built for publication: Note on minimal finite automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779161)
