Abstract. Motivated by the Babai conjecture and theČerný conjecture, we study the reset thresholds of automata with the transition monoid equal to the full monoid of transformations of the state set. For automata with n states in this class, we prove that the reset thresholds are upperbounded by 2n 2 − 6n + 5 and can attain the value. In addition, we study diameters of the pair digraphs of permutation automata and construct n-state permutation automata with diameter Background and OverviewCompletely reachable automata, i.e., deterministic finite automata in which every non-empty subset of the state set occurs as the image of the whole state set under the action of a suitable input word, appeared in the study of descriptional complexity of formal languages [26] and in relation to theČerný conjecture [13]. In [6] an emphasis has been made on automata in this class with minimal transition monoid size. In the present paper we focus on automata being in a sense the extreme opposites of those studied in [6], namely, on automata of maximal transition monoid size. In other words, we consider automata with full transition monoid, i.e., transition monoid equal to the full monoid of transformations of the state set; clearly, automata with this property are completely reachable. There are several reasons justifying special attention to automata with full transition monoid. First, as observed in [6], the membership problem for this class of automata is decidable in polynomial time (of the size of the input automaton) while ⋆ Vladimir Gusev and Mikhail V.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.