A cornering strategy for synchronizing a DFA

DOI10.1016/J.TCS.2026.115864MaRDI QIDQ7229629zbMATH OpenFDO

Authors Peter Bradshaw, Alexander Clow, Ladislav Stacho

Publication date 16 April 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115864

zbMATH Keywords

deterministic finite automatasynchronizing automata

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A note on diameter and the degree sequence of a graph
• An extremal problem for two families of sets
• An improvement to a recent upper bound for synchronizing words of finite automata
• Convex Polytopes
• Convexity. An analytic viewpoint
• scientific article; zbMATH DE number 7228447 (Why is no real title available?)
• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 3266647 (Why is no real title available?)
• Large aperiodic semigroups
• Modifying the upper bound on the length of minimal synchronizing word
• On two Combinatorial Problems Arising from Automata Theory
• Radius, diameter, and minimum degree
• Reset Sequences for Monotonic Automata
• Synchronization of finite automata
• Synchronizing finite automata on Eulerian digraphs.
• Synchronizing generalized monotonic automata
• Synchronizing monotonic automata
• The Černý conjecture for aperiodic automata

This page was built for publication: A cornering strategy for synchronizing a DFA

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