|Publication ahead of print|
RAIRO-Theor. Inf. Appl.
|Published online||15 November 2018|
The complexity of weakly recognizing morphisms★
FMI, University of Stuttgart,
2 Department of Computer Science, Loughborough University, Loughborough LE11 3TU, UK.
* Corresponding author: email@example.com
Accepted: 10 September 2018
Weakly recognizing morphisms from free semigroups onto finite semigroups are a classical way for defining the class of ω-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 study the descriptional complexity of various constructions and the computational complexity of various decision problems for weakly recognizing morphisms. The constructions we consider are the conversion from and to Büchi automata, the conversion into strongly recognizing morphisms, as well as complementation. We also show that the fixed membership problem is NC1-complete, the general membership problem is in L and that the inclusion, equivalence and universality problems are NL-complete. The emptiness problem is shown to be NL-complete if the input is given as a non-surjective morphism.
Mathematics Subject Classification: 20M35 / 03D15 / 68Q17 / 68Q19
Key words: semigroup / regular language / automata / decision problem / descriptional complexity / computational complexity / operations
© EDP Sciences, 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.