Synchronizing almost-group automata
From MaRDI portal
Publication:5859664
DOI10.1142/S0129054120420058zbMATH Open1458.68089OpenAlexW3110860036MaRDI QIDQ5859664FDOQ5859664
Authors: Mikhail V. Berlinkov, Cyril Nicaud 
Publication date: 19 April 2021
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054120420058
Recommendations
Cites Work
- Synchronizing Automata and the Černý Conjecture
- Synchronization and stability of finite automata
- Title not available (Why is that?)
- Reset Sequences for Monotonic Automata
- On two Combinatorial Problems Arising from Automata Theory
- Title not available (Why is that?)
- Synchronizing random automata
- The road coloring problem
- On the probability of being synchronizable
- Algorithms and Data Structures
- Random deterministic automata
- Title not available (Why is that?)
- Synchronizing random almost-group automata
- Title not available (Why is that?)
- A quadratic algorithm for road coloring
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 random almost-group automata
- On two problems of almost synchronizing groups
- Fast synchronization of inhomogenous random automata
- Synchronizing groups and automata
- Groups and semigroups defined by colorings of synchronizing automata.
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)
