ON A CONJECTURE BY CARPI AND D'ALESSANDRO

DOI10.1142/S012905411100888XzbMath1252.68163WikidataQ123240419 ScholiaQ123240419MaRDI QIDQ2909095

Mikhail V. Berlinkov

Publication date: 29 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

synchronizing automataČerný conjectureextension method

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Synchronizing Automata on Quasi-Eulerian Digraph ⋮ Primitive digraphs with large exponents and slowly synchronizing automata ⋮ Synchronizing Automata with Extremal Properties ⋮ SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time for Synchronizing Automata

Cites Work

• Strongly transitive automata and the Černý conjecture
• An extremal problem for two families of sets
• Reset words for commutative and solvable automata
• 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 Synchronization Problem for Strongly Transitive Automata
• Synchronizing Automata and the Černý Conjecture
• The Averaging Trick and the Černý Conjecture
• A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata

This page was built for publication: ON A CONJECTURE BY CARPI AND D'ALESSANDRO