Synchronizing random automata
From MaRDI portal
Recommendations
Cited in
(21)- Synchronizing random almost-group automata
- Černý's conjecture and the road colouring problem
- Circular automata synchronize with high probability
- A quadratic algorithm for road coloring
- On the probability of being synchronizable
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- On the synchronizing probability function and the triple rendezvous time for synchronizing automata
- Experiments with Synchronizing Automata
- Synchronizing automata with random inputs (short paper)
- COMPAS -- a computing package for synchronization
- Experiments on Synchronizing Automata
- scientific article; zbMATH DE number 3858278 (Why is no real title available?)
- scientific article; zbMATH DE number 3864504 (Why is no real title available?)
- Synchronizing random automata on a 4-letter alphabet
- scientific article; zbMATH DE number 6861928 (Why is no real title available?)
- On randomized generation of slowly synchronizing automata
- Experimental study of the shortest reset word of random automata
- Synchronizing almost-group automata
- Fast synchronization of inhomogenous random automata
- Short Synchronizing Words for Random Automata
- Short synchronizing words for random automata
This page was built for publication: Synchronizing random automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5414550)