Fast synchronization of inhomogenous random automata
From MaRDI portal
Publication:6178462
DOI10.1016/j.ic.2023.105129arXiv2206.05043MaRDI QIDQ6178462
Zsombor Várkonyi, Balázs Gerencsér
Publication date: 18 January 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.05043
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extremal problem for two families of sets
- On two Combinatorial Problems Arising from Automata Theory
- The action of a few permutations onr-tuples is quickly transitive
- A Fast Algorithm Finding the Shortest Reset Words
- Experimental Study of the Shortest Reset Word of Random Automata
- The Cerny Conjecture Holds with High Probability
- An improvement to a recent upper bound for synchronizing words of finite automata
- Synchronizing Almost-Group Automata
- The probability of generating the symmetric group
This page was built for publication: Fast synchronization of inhomogenous random automata
