Synchronizing Automata on Quasi-Eulerian Digraph

DOI10.1007/978-3-642-31606-7_8zbMath1297.68107arXiv1203.3402OpenAlexW1934547033MaRDI QIDQ2914697

Mikhail V. Berlinkov

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.3402

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• The Černý conjecture for one-cluster automata with prime length cycle
• An extremal problem for two families of sets
• Synchronizing finite automata on Eulerian digraphs.
• Gaps in the exponent set of primitive matrices
• Unzerlegbare, nicht negative Matrizen
• The Synchronizing Probability Function of an Automaton
• ON A CONJECTURE BY CARPI AND D'ALESSANDRO
• THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
• Modifying the Upper Bound on the Length of Minimal Synchronizing Word
• Synchronizing Automata and the Černý Conjecture
• Slowly Synchronizing Automata and Digraphs
• On two Combinatorial Problems Arising from Automata Theory

This page was built for publication: Synchronizing Automata on Quasi-Eulerian Digraph