Operations on Weakly Recognizing Morphisms - Descriptional Complexity of Formal Systems (DCFS 2016) Access content directly
Conference Papers Year : 2016

Operations on Weakly Recognizing Morphisms

Lukas Fleischer
  • Function : Author
  • PersonId : 1022735
Manfred Kufleitner
  • Function : Author
  • PersonId : 1022736


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.
Fichier principal
Vignette du fichier
416473_1_En_10_Chapter.pdf (402.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01633955 , version 1 (13-11-2017)





Lukas Fleischer, Manfred Kufleitner. Operations on Weakly Recognizing Morphisms. 18th International Workshop on Descriptional Complexity of Formal Systems (DCFS), Jul 2016, Bucharest, Romania. pp.126-137, ⟨10.1007/978-3-319-41114-9_10⟩. ⟨hal-01633955⟩
59 View
35 Download



Gmail Facebook X LinkedIn More