On a conjecture by Carpi and D'Alessandro
From MaRDI portal
Publication:2909095
Recommendations
Cites work
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- An extremal problem for two families of sets
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Strongly transitive automata and the Černý conjecture
- Synchronizing Automata and the Černý Conjecture
- Synchronizing finite automata on Eulerian digraphs.
- The Synchronization Problem for Strongly Transitive Automata
- The averaging trick and the Černý conjecture
Cited in
(10)- New results on conjectures by Lichnerowicz and Caratheodory
- Synchronizing quasi-Eulerian and quasi-one-cluster automata
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- On the interplay between Černý and Babai's conjectures
- On the interplay between Babai and Černý's conjectures
- Primitive digraphs with large exponents and slowly synchronizing automata
- On a conjecture by Carpi and D'Alessandro
- Synchronizing Automata with Extremal Properties
- Synchronizing automata on quasi-Eulerian digraph
- scientific article; zbMATH DE number 515523 (Why is no real title available?)
This page was built for publication: On a conjecture by Carpi and D'Alessandro
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909095)