Bondar, Eugenija A.; Casas, David; Volkov, Mikhail V. Completely reachable automata: an interplay between automata, graphs, and trees. (English) Zbl 07749893 Int. J. Found. Comput. Sci. 34, No. 6, 655-690 (2023). MSC: 68Qxx 20Mxx 05Cxx PDFBibTeX XMLCite \textit{E. A. Bondar} et al., Int. J. Found. Comput. Sci. 34, No. 6, 655--690 (2023; Zbl 07749893) Full Text: DOI arXiv
Kari, Jarkko; Volkov, Mikhail V. Černý’s conjecture and the road colouring problem. (English) Zbl 07469513 Pin, Jean-Éric (ed.), Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 525-565 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{J. Kari} and \textit{M. V. Volkov}, in: Handbook of automata theory. Volume I. Theoretical foundations. Berlin: European Mathematical Society (EMS). 525--565 (2021; Zbl 07469513) Full Text: DOI
Berlinkov, Mikhail V.; Ferens, Robert; Szykuła, Marek Preimage problems for deterministic finite automata. (English) Zbl 1464.68148 J. Comput. Syst. Sci. 115, 214-234 (2021). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. V. Berlinkov} et al., J. Comput. Syst. Sci. 115, 214--234 (2021; Zbl 1464.68148) Full Text: DOI arXiv
Szykuła, Marek Improving the upper bound on the length of the shortest reset word. (English) Zbl 1440.68164 Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 56, 13 p. (2018). MSC: 68Q45 PDFBibTeX XMLCite \textit{M. Szykuła}, LIPIcs -- Leibniz Int. Proc. Inform. 96, Article 56, 13 p. (2018; Zbl 1440.68164) Full Text: DOI arXiv
Gerencsér, Balázs; Gusev, Vladimir V.; Jungers, Raphaël M. Primitive sets of nonnegative matrices and synchronizing automata. (English) Zbl 1378.15020 SIAM J. Matrix Anal. Appl. 39, No. 1, 83-98 (2018). MSC: 15B34 15B48 05A05 68Q25 68Q45 PDFBibTeX XMLCite \textit{B. Gerencsér} et al., SIAM J. Matrix Anal. Appl. 39, No. 1, 83--98 (2018; Zbl 1378.15020) Full Text: DOI arXiv
Vorel, Vojtěch Complexity of a problem concerning reset words for Eulerian binary automata. (English) Zbl 1362.68159 Inf. Comput. 253, Part 3, 497-509 (2017). MSC: 68Q45 68Q17 68Q25 PDFBibTeX XMLCite \textit{V. Vorel}, Inf. Comput. 253, Part 3, 497--509 (2017; Zbl 1362.68159) Full Text: DOI
Kisielewicz, Andrzej; Kowalski, Jakub; Szykuła, Marek Experiments with synchronizing automata. (English) Zbl 1475.68159 Han, Yo-Sub (ed.) et al., Implementation and application of automata. 21st international conference, CIAA 2016, Seoul, South Korea, July 19–22, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9705, 176-188 (2016). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Kisielewicz} et al., Lect. Notes Comput. Sci. 9705, 176--188 (2016; Zbl 1475.68159) Full Text: DOI arXiv
Gonze, François; Jungers, Raphaël M. On the synchronizing probability function and the triple rendezvous time for synchronizing automata. (English) Zbl 1339.68147 SIAM J. Discrete Math. 30, No. 2, 995-1014 (2016). MSC: 68Q45 68Q87 91A80 PDFBibTeX XMLCite \textit{F. Gonze} and \textit{R. M. Jungers}, SIAM J. Discrete Math. 30, No. 2, 995--1014 (2016; Zbl 1339.68147) Full Text: DOI arXiv
Blondel, Vincent D.; Jungers, Raphaël M.; Olshevsky, Alex On primitivity of sets of matrices. (English) Zbl 1337.15024 Automatica 61, 80-88 (2015). MSC: 15B48 68Q25 68Q45 PDFBibTeX XMLCite \textit{V. D. Blondel} et al., Automatica 61, 80--88 (2015; Zbl 1337.15024) Full Text: DOI arXiv
Kisielewicz, Andrzej; Szykuła, Marek Synchronizing automata with extremal properties. (English) Zbl 1465.68154 Italiano, F. (ed.) et al., Mathematical foundations of computer science 2015. 40th international symposium, MFCS 2015, Milan, Italy, August 24–28, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9234, 331-343 (2015). MSC: 68Q45 PDFBibTeX XMLCite \textit{A. Kisielewicz} and \textit{M. Szykuła}, Lect. Notes Comput. Sci. 9234, 331--343 (2015; Zbl 1465.68154) Full Text: DOI arXiv