On Synchronizing Tree Automata and Their Work-Optimal Parallel Run, Usable for Parallel Tree Pattern Matching. - Stepán Plachý; Jan Janousek (SOFSEM, 2020)

On the Smallest Synchronizing Terms of Finite Tree Automata. - Václav Blazej; Jan Janousek; Stepán Plachý (CIAA, 2023)

Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching. - Jan Janousek; Stepán Plachý (SOFSEM, 2024)