On the smallest synchronizing terms of finite tree automata

DOI10.1007/978-3-031-40247-0_5MaRDI QIDQ6199864zbMATH OpenFDO

Authors 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 automatasynchronizing stringČerný conjecturesynchronizing term

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3222112 (Why is no real title available?)
• scientific article; zbMATH DE number 3354928 (Why is no real title available?)
• A lower bound for the length of the shortest carefully synchronizing words
• An improvement to a recent upper bound for synchronizing words of finite automata
• Asymptotic estimate of the length of a diagnostic word for a finite automaton
• Careful synchronization of partial automata with restricted alphabets
• Handbook of automata theory. Volume I. Theoretical foundations
• On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching
• On two Combinatorial Problems Arising from Automata Theory
• Some results concerning careful synchronization of partial automata and subset synchronization of DFA's

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

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