Almost optimal bound of recurrent word length for regular automata

DOI10.1007/BF02366314zbMath0856.68104MaRDI QIDQ1922340

I. K. Rystsov

Publication date: 3 February 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

algebraic method for cyclic automata

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (5)

Cerny's conjecture for automata with simple idempotents ⋮ The Synchronization Problem for Locally Strongly Transitive Automata ⋮ The Synchronization Problem for Strongly Transitive Automata ⋮ Černý's conjecture and the road colouring problem ⋮ Strongly transitive automata and the Černý conjecture

Cites Work

• Rank of a finite automaton
• In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Almost optimal bound of recurrent word length for regular automata