No. Title Author Year
1 Completely Reachable Automata: A Polynomial Algorithm and Quadratic Upper Bounds Ferens, Robert et al. 2023
2 An Improved Algorithm for Finding the Shortest Synchronizing Words Szykuła, Marek et al. 2022
3 Lower Bounds on Avoiding Thresholds Ferens, Robert et al. 2021
4 Synchronizing Strongly Connected Partial DFAs Berlinkov, Mikhail V. et al. 2021
5 Existential Length Universality Gawrychowski, Paweł et al. 2020
6 Complexity of Preimage Problems for Deterministic Finite Automata Berlinkov, Mikhail V. et al. 2018
7 Finding Short Synchronizing Words for Prefix Codes Ryzhikov, Andrew et al. 2018
8 Improving the Upper Bound on the Length of the Shortest Reset Word Szykula, Marek 2018
9 Attainable Values of Reset Thresholds Dzyga, Michalina et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 9

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI