Skip to Main content Skip to Navigation
Conference papers

Operations on Weakly Recognizing Morphisms

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01633955
Contributor : Hal Ifip <>
Submitted on : Monday, November 13, 2017 - 3:32:51 PM
Last modification on : Monday, November 13, 2017 - 3:35:33 PM
Long-term archiving on: : Wednesday, February 14, 2018 - 3:58:10 PM

File

416473_1_En_10_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

155

Files downloads

141