Almost optimal bound of recurrent word length for regular automata
From MaRDI portal
Publication:1922340
DOI10.1007/BF02366314zbMath0856.68104MaRDI QIDQ1922340
Publication date: 3 February 1997
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Related Items
Strongly transitive automata and the Černý conjecture, Černý's conjecture and the road colouring problem, Cerny's conjecture for automata with simple idempotents, The Synchronization Problem for Locally Strongly Transitive Automata, The Synchronization Problem for Strongly Transitive Automata
Cites Work