Abstract : Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of $$\omega $$-regular languages, i.e., a set of infinite words is weakly recognizable by such a morphism if and only if it is accepted by some Büchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion from and to Büchi automata, the conversion into strongly recognizing morphisms, and complementation. For some problems, we are able to give more precise bounds in the case of binary alphabets or simple semigroups.
Type de document :
Communication dans un congrès
Cezar Câmpeanu; Florin Manea; Jeffrey Shallit. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. Springer International Publishing, Lecture Notes in Computer Science, LNCS-9777, pp.126-137, 2016, Descriptional Complexity of Formal Systems. 〈10.1007/978-3-319-41114-9_10〉
https://hal.inria.fr/hal-01633955
Contributeur : Hal Ifip
<>
Soumis le : lundi 13 novembre 2017 - 15:32:51
Dernière modification le : lundi 13 novembre 2017 - 15:35:33
Document(s) archivé(s) le : mercredi 14 février 2018 - 15:58:10
