Synchronizing quasi-Eulerian and quasi-one-cluster automata
From MaRDI portal
Publication:5401552
Recommendations
Cites work
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- An extremal problem for two families of sets
- On a conjecture by Carpi and D'Alessandro
- Synchronizing finite automata on Eulerian digraphs.
- The averaging trick and the Černý conjecture
- The synchronizing probability function of an automaton
- The Černý conjecture for one-cluster automata with prime length cycle
- Unzerlegbare, nicht negative Matrizen
Cited in
(7)- An extremal series of Eulerian synchronizing automata
- Lower bounds for the length of reset words in Eulerian automata
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- Synchronizing Automata with Extremal Properties
- Complexity of preimage problems for deterministic finite automata
- Synchronizing automata on quasi-Eulerian digraph
- Preimage problems for deterministic finite 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)