Synchronizing finite automata with short reset words
From MaRDI portal
Publication:1008633
DOI10.1016/J.AMC.2008.06.019zbMath1163.68024OpenAlexW2002132436MaRDI QIDQ1008633
Publication date: 30 March 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2008.06.019
Related Items (7)
Approximating the minimum length of synchronizing words is hard ⋮ Complexity of road coloring with prescribed reset words ⋮ Genetic Algorithm for Synchronization ⋮ The relation between preset distinguishing sequences and synchronizing sequences ⋮ COMPAS - A Computing Package for Synchronization ⋮ Černý's conjecture and the road colouring problem ⋮ Computing the shortest reset words of synchronizing automata
Uses Software
Cites Work
- Synchronizing monotonic automata
- An extremal problem for two families of sets
- Synchronizing finite automata on Eulerian digraphs.
- Rank of a finite automaton
- Reset Sequences for Monotonic Automata
- On two Combinatorial Problems Arising from Automata Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Synchronizing finite automata with short reset words
