On the smallest synchronizing terms of finite tree automata
From MaRDI portal
Publication:6199864
DOI10.1007/978-3-031-40247-0_5MaRDI QIDQ6199864FDOQ6199864
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)
Cites Work
- On two Combinatorial Problems Arising from Automata Theory
- Title not available (Why is that?)
- Careful synchronization of partial automata with restricted alphabets
- Title not available (Why is that?)
- An improvement to a recent upper bound for synchronizing words of finite automata
- A lower bound for the length of the shortest carefully synchronizing words
- Asymptotic estimate of the length of a diagnostic word for a finite automaton
- 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
- Handbook of automata theory. Volume I. Theoretical foundations
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)
