Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Completely Reachable Automata Read chapter Read first chapter

2016 | OriginalPaper | Chapter

Operations on Weakly Recognizing Morphisms

Authors : Lukas Fleischer, Manfred Kufleitner

Published in: Descriptional Complexity of Formal Systems

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems
next chapter Descriptional Complexity of Bounded Regular Languages
Literature
1.
2.
Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6, 66–92 (1960)MathSciNetCrossRefMATH
3.
4.
Devadze, H.M.: Generating sets of the semigroup of all binary relations in a finite set. Doklady Akademii Nauk BSSR 12, 765–768 (1968)MathSciNetMATH
5.
Fleischer, L., Kufleitner, M.: Efficient algorithms for morphisms over omega-regular languages. In: Proceedings of the FSTTCS 2015. LIPIcs, vol. 45, pp. 112–124. Dagstuhl Publishing (2015)
6.
7.
8.
Konieczny, J.: A proof of Devadze’s theorem on generators of the semigroup of boolean matrices. Semigroup Forum 83(2), 281–288 (2011)MathSciNetCrossRefMATH
9.
Pécuchet, J.: Variétés de semis groupes et mots infinis. In: Proceedings of the STACS 1986, pp. 180–191 (1986)
10.
Perrin, D., Pin, J.-É.: Infinite Words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)MATH
11.
12.
Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two way finite automata. In: Proceedings of the STOC 1978, pp. 275–286. ACM Press (1978)
13.
Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, chap. 4, pp. 133–191. Elsevier (1990)
14.
Yan, Q.: Lower bounds for complementation of omega-automata via the full automata technique. Logical Methods Comput. Sci. 4(1), 1–20 (2008)MathSciNetCrossRefMATH
Metadata
Title
Operations on Weakly Recognizing Morphisms
Authors
Lukas Fleischer
Manfred Kufleitner
Copyright Year
2016
Book
Descriptional Complexity of Formal Systems

Print ISBN: 978-3-319-41113-2

Electronic ISBN: 978-3-319-41114-9

Copyright Year: 2016

DOI
https://doi.org/10.1007/978-3-319-41114-9_10

Premium Partner

    Image Credits