On the smallest synchronizing terms of finite tree automata

DOI10.1007/978-3-031-40247-0_5MaRDI QIDQ6199864

Václav Blažej, Jan Janoušek, Štěpán Plachý

Publication date: 28 February 2024

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

zbMATH Keywords

automata theorytree automataČerný conjecturesynchronizing stringsynchronizing term

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for the length of the shortest carefully synchronizing words
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
• On Synchronizing Tree Automata and Their Work–Optimal Parallel Run, Usable for Parallel Tree Pattern Matching
• On two Combinatorial Problems Arising from Automata Theory
• Asymptotic estimate of the length of a diagnostic word for a finite automaton
• Careful Synchronization of Partial Automata with Restricted Alphabets
• An improvement to a recent upper bound for synchronizing words of finite automata
• Handbook of Automata Theory

This page was built for publication: On the smallest synchronizing terms of finite tree automata