The Averaging Trick and the Černý Conjecture
From MaRDI portal
Publication:3584912
DOI10.1007/978-3-642-14455-4_38zbMath1250.68180OpenAlexW2035311548MaRDI QIDQ3584912
Publication date: 31 August 2010
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_38
Related Items
Composition Sequences and Synchronizing Automata ⋮ ON A CONJECTURE BY CARPI AND D'ALESSANDRO ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ On the Synchronizing Probability Function and the Triple Rendezvous Time ⋮ Modifying the Upper Bound on the Length of Minimal Synchronizing Word ⋮ Černý's conjecture and the road colouring problem ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices