weakrec.DCFS2016.final.pdf (402.91 kB)
Download file

Operations on weakly recognizing morphisms

Download (402.91 kB)
conference contribution
posted on 23.02.2018, 09:52 by Lukas Fleischer, Manfred Kufleitner
© IFIP International Federation for Information Processing 2016. 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 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.

Funding

This work was supported by the DFG grants DI 435/5-2 and KU 2716/1-1.

History

School

  • Science

Department

  • Computer Science

Published in

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volume

9777

Pages

126 - 137

Citation

FLEISCHER, L. and KUFLEITNER, M., 2016. Operations on weakly recognizing morphisms. IN: Campeanu, C., Manea, F. and Shallit, J. (eds.) Descriptional Complexity of Formal Systems, 18th IFIP WG 1.2 International Conference, DCFS 2016, Bucharest, Romania, July 5-8, 2016. Proceedings. Chaim: Springer, pp. 126-137.

Publisher

© Springer

Version

AM (Accepted Manuscript)

Publisher statement

This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/

Publication date

2016

Notes

This is a pre-copyedited version of a contribution published in Campeanu, C., Manea, F. Shallit, J. (eds.) Descriptional Complexity of Formal Systems, 18th IFIP WG 1.2 International Conference, DCFS 2016 published by Springer. The definitive authenticated version is available online via https://doi.org/10.1007/978-3-319-41114-9_10

ISBN

9783319411132

ISSN

0302-9743

eISSN

1611-3349

Book series

Lecture Notes in Computer Science;9777

Language

en

Usage metrics

Keywords

Exports