DFAs and PFAs with long shortest synchronizing word length

DOI10.1007/978-3-319-62809-7_8zbMath1410.68201arXiv1703.07618OpenAlexW2599074495MaRDI QIDQ2408797

Michiel de Bondt, Hans Zantema, Henk Don

Publication date: 13 October 2017

Full work available at URL: https://arxiv.org/abs/1703.07618

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Using SAT solvers for synchronization issues in non-deterministic automata ⋮ Unnamed Item ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ Finding DFAs with Maximal Shortest Synchronizing Word Length ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ Extremal synchronizing circular automata ⋮ Černý's conjecture and the road colouring problem ⋮ The Synchronizing Probability Function for Primitive Sets of Matrices

This page was built for publication: DFAs and PFAs with long shortest synchronizing word length