Finding DFAs with Maximal Shortest Synchronizing Word Length

DOI10.1007/978-3-319-53733-7_18zbMath1487.68144OpenAlexW2527137011MaRDI QIDQ5739001

Henk Don, Hans Zantema

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2066/173189

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Slowly synchronizing automata with fixed alphabet size ⋮ Extremal synchronizing circular automata ⋮ Černý's conjecture and the road colouring problem

Uses Software

• TESTAS
• Yices

Cites Work

• The Černý conjecture for one-cluster automata with prime length cycle
• An extremal problem for two families of sets
• DFAs and PFAs with long shortest synchronizing word length
• A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
• Synchronizing Automata and the Černý Conjecture
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• On two Combinatorial Problems Arising from Automata Theory
• An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding DFAs with Maximal Shortest Synchronizing Word Length