A new lower bound for reset threshold of binary synchronizing automata with sink

DOI10.25596/JALC-2019-153MaRDI QIDQ5208367zbMATH OpenFDO

Authors D. S. Ananichev, Vojtěch Vorel

Publication date 15 January 2020

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

zbMATH Keywords

reset thresholdsynchronizing 0-automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Attainable values of reset thresholds
• Subset synchronization and careful synchronization of binary finite automata
• Synchronizing automata of bounded rank
• Lower Bounds for the Length of Reset Words in Eulerian Automata
• scientific article; zbMATH DE number 7152087

Cited in

(4)

• On Nonnegative Integer Matrices and Short Killing Words
• Attainable values of reset thresholds
• A note on a recent attempt to improve the Pin-Frankl bound
• Completely reachable almost group automata

This page was built for publication: A new lower bound for reset threshold of binary synchronizing automata with sink

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