Synchronizing almost-group automata
From MaRDI portal
Publication:5859664
Recommendations
Cites work
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 6861928 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- A quadratic algorithm for road coloring
- Algorithms and Data Structures
- On the probability of being synchronizable
- On two Combinatorial Problems Arising from Automata Theory
- Random deterministic automata
- Reset Sequences for Monotonic Automata
- Synchronization and stability of finite automata
- Synchronizing Automata and the Černý Conjecture
- Synchronizing random almost-group automata
- Synchronizing random automata
- The road coloring problem
Cited in
(7)- Groups synchronizing a transformation of non-uniform kernel
- Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
- Synchronizing groups and automata
- Synchronizing random almost-group automata
- Groups and semigroups defined by colorings of synchronizing automata.
- Fast synchronization of inhomogenous random automata
- On two problems of almost synchronizing groups
This page was built for publication: Synchronizing almost-group automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859664)
