Bideterministic Automata and Minimal Representations of Regular Languages
From MaRDI portal
Publication:3559792
Recommendations
- Bideterministic automata and minimal representations of regular languages
- On Transition Minimality of Bideterministic Automata
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
- Some Minimality Results on Biresidual and Biseparable Automata
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Minimal partial languages and automata
- Minimal partial languages and automata
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language
- Concise representations of regular languages by degree and probabilistic finite automata
- Limited automata and regular languages
Cited in
(13)- Bideterministic weighted automata
- Some Minimality Results on Biresidual and Biseparable Automata
- Minimal NFA and biRFSA Languages
- Bideterministic automata and minimal representations of regular languages
- On automata recognizing birecurrent sets
- Bideterministic weighted automata
- Deterministic biautomata and subclasses of deterministic linear languages
- Concise representations of regular languages by degree and probabilistic finite automata
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
- Binary completely reachable automata
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language
- On Transition Minimality of Bideterministic Automata
- Graph spectral properties of deterministic finite automata (short paper)
This page was built for publication: Bideterministic Automata and Minimal Representations of Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3559792)
