On a conjecture by Carpi and D'Alessandro
From MaRDI portal
Publication:2909095
DOI10.1142/S012905411100888XzbMATH Open1252.68163WikidataQ123240419 ScholiaQ123240419MaRDI QIDQ2909095FDOQ2909095
Authors: Mikhail V. Berlinkov 
Publication date: 29 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Synchronizing Automata and the Černý Conjecture
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- Reset Sequences for Monotonic Automata
- The averaging trick and the Černý conjecture
- Strongly transitive automata and the Černý conjecture
- The Synchronization Problem for Strongly Transitive Automata
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
- Reset words for commutative and solvable automata
Cited In (10)
- New results on conjectures by Lichnerowicz and Caratheodory
- On a conjecture by Carpi and D'Alessandro
- On the interplay between Babai and Černý's conjectures
- Synchronizing Automata with Extremal Properties
- On the interplay between Černý and Babai's conjectures
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- Title not available (Why is that?)
- Primitive digraphs with large exponents and slowly synchronizing automata
- Synchronizing quasi-Eulerian and quasi-one-cluster automata
- Synchronizing automata on quasi-Eulerian digraph
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)
