Generating Small Automata and the Černý Conjecture

DOI10.1007/978-3-642-39274-0_30zbMath1298.68143OpenAlexW93607743MaRDI QIDQ5327508

Marek Szykuła, Andrzej P. Kisielewicz

Publication date: 7 August 2013

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39274-0_30

zbMATH Keywords

synchronizing wordČerný conjecturenonisomorphic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (10)

Reset Thresholds of Automata with Two Cycle Lengths ⋮ On the Number of Synchronizing Colorings of Digraphs ⋮ Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Large Aperiodic Semigroups ⋮ Syntactic complexity of suffix-free languages ⋮ Slowly synchronizing automata with fixed alphabet size ⋮ An Extremal Series of Eulerian Synchronizing Automata ⋮ Experiments with Synchronizing Automata ⋮ Černý's conjecture and the road colouring problem ⋮ Computing the shortest reset words of synchronizing automata

This page was built for publication: Generating Small Automata and the Černý Conjecture