Strongly transitive automata and the Černý conjecture
From MaRDI portal
Publication:1038421
DOI10.1007/s00236-009-0106-7zbMath1186.68248OpenAlexW2028432900WikidataQ123207211 ScholiaQ123207211MaRDI QIDQ1038421
Flavio D'Alessandro, Arturo Carpi
Publication date: 18 November 2009
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-009-0106-7
Related Items (5)
ON A CONJECTURE BY CARPI AND D'ALESSANDRO ⋮ On the length of uncompletable words in unambiguous automata ⋮ On incomplete and synchronizing finite sets ⋮ A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA ⋮ An Extremal Series of Eulerian Synchronizing Automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unambiguous automata
- On synchronizing unambiguous automata
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing generalized monotonic automata
- Almost optimal bound of recurrent word length for regular automata
- Reset Sequences for Monotonic Automata
- The Synchronization Problem for Strongly Transitive Automata
- Synchronizing Automata and the Černý Conjecture
- On two Combinatorial Problems Arising from Automata Theory
This page was built for publication: Strongly transitive automata and the Černý conjecture
