On smallest synchronizing terms over constant alphabets
Luisa Herrmann, Richard Mörbitz
Abstract
We show a subexponential lower bound on the reset threshold of synchronizing deterministic finite tree automata (DTA) over alphabets of just two symbols. This significantly improves the previous one, which was quadratic in the number of states. Our result also narrows the gap towards the lower bound for DTA over alphabets that grow linearly with the number of states, as well as the best known upper bound, both of which are currently exponential.
Create a lesson
Related papers
Behavioral Memory under Symmetry in One-Way Quantum Automata
Zeyu Chen
Verification of K- and Infinite-Step Strong/Weak Anonymity Using Concurrent Compositions
Jiahui Zhang, Kuize Zhang, Xiaoguang Han et al.
Construction of a DFA for Computing Grundy Numbers in the Successful Derivation Games on Right-Linear Grammars
Yoshiaki Takata, Yusuke Inoue, Hiroyuki Seki
Two-State Max-Plus Comparison Is Decidable
Keigo Oka
A note on the reduction from LTLf to LTL
Alexandre Duret-Lutz
Further Remarks on Separating Words
John Nicol