Implementation of the algorithm for testing an automaton for synchronization in linear expected time

DOI10.25596/JALC-2019-139MaRDI QIDQ5208366zbMATH OpenFDO

Authors Pavel Ageev

Publication date 15 January 2020

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

zbMATH Keywords

synchronizing automataBerlinkov's algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Experiments with Synchronizing Automata
• scientific article; zbMATH DE number 6861928
• Synchronizing automata with random inputs (short paper)
• On the probability of being synchronizable
• Computing the shortest reset words of synchronizing automata

Cited in

(3)

• The synchronization problem in protocol testing and its complexity
• Černý's conjecture and the road colouring problem
• COMPAS -- a computing package for synchronization

This page was built for publication: Implementation of the algorithm for testing an automaton for synchronization in linear expected time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5208366)