Extremal binary PFAs in a Černý family
From MaRDI portal
Publication:832924
DOI10.1007/978-3-030-81508-0_7OpenAlexW3187086614MaRDI QIDQ832924
Henk Don, Stijn Cambie, Michiel de Bondt
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_7
Related Items (1)
Cites Work
- Unnamed Item
- An extremal problem for two families of sets
- Synchronizing Automata and the Černý Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- An improvement to a recent upper bound for synchronizing words of finite automata
- Lower Bounds for Synchronizing Word Lengths in Partial Automata
This page was built for publication: Extremal binary PFAs in a Černý family