Synchronizing quasi-Eulerian and quasi-one-cluster automata
DOI10.1142/S0129054113400157zbMATH Open1305.68109OpenAlexW2036755336MaRDI QIDQ5401552FDOQ5401552
Authors: 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
Recommendations
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Formal languages and automata (68Q45)
Cites Work
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- The Černý conjecture for one-cluster automata with prime length cycle
- Unzerlegbare, nicht negative Matrizen
- On a conjecture by Carpi and D'Alessandro
- The averaging trick and the Černý conjecture
- The synchronizing probability function of an automaton
Cited In (8)
- Preimage problems for deterministic finite automata
- Complexity of Preimage Problems for Deterministic Finite Automata
- Algebraic synchronization criterion and computing reset words
- Synchronizing Automata with Extremal Properties
- Lower bounds for the length of reset words in Eulerian automata
- Title not available (Why is that?)
- Synchronizing automata on quasi-Eulerian digraph
- An Extremal Series of Eulerian Synchronizing Automata
This page was built for publication: Synchronizing quasi-Eulerian and quasi-one-cluster automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401552)
