SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA

DOI10.1142/S0129054113400157zbMath1305.68109OpenAlexW2036755336MaRDI QIDQ5401552

Mikhail V. Berlinkov

Publication date: 10 March 2014

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

Full work available at URL: https://doi.org/10.1142/s0129054113400157

zbMATH Keywords

Markov chainssynchronizing automataČerný conjectureprimitive matricesextension method

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (6)

Unnamed Item ⋮ Synchronizing Automata with Extremal Properties ⋮ Preimage problems for deterministic finite automata ⋮ Complexity of Preimage Problems for Deterministic Finite Automata ⋮ Algebraic synchronization criterion and computing reset words ⋮ An Extremal Series of Eulerian Synchronizing Automata

Cites Work

• 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.
• 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
• A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA

This page was built for publication: SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA