Operations on Weakly Recognizing Morphisms

  title={Operations on Weakly Recognizing Morphisms},
  author={Lukas Fleischer and M. Kufleitner},
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 Buchi automaton. We consider the descriptional complexity of various constructions for weakly recognizing morphisms. This includes the conversion from and to Buchi automata, the conversion into strongly recognizing morphisms, and… Expand


Efficient Algorithms for Morphisms over Omega-Regular Languages
A quadratic-time algorithm for computing the syntactic morphism from any given strongly recognizing morphism, thereby showing that minimization is easy and algorithms for efficiently solving various decision problems for weakly recognizing morphisms are given. Expand
Automata on Infinite Objects
  • W. Thomas
  • Computer Science, Mathematics
  • Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
  • 1990
This chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree. Expand
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
  • Qiqi Yan
  • Computer Science, Mathematics
  • Log. Methods Comput. Sci.
  • 2008
This paper suggests first considering the class of full automata in lower bound analysis, and later reducing the size of the large alphabet via alphabet substitutions, and applies such technique to the complementation of nondeterministic \omega-automata, and gets several lower bound results. Expand
Nondeterminism and the size of two way finite automata
This work considers two questions on regular languages resembling these open problems of P, NP, and LOGSPACE, and 2-way non-deterministic and2-way deterministic finite automata. Expand
A Syntactic Congruence for Rational omega-Language
  • A. Arnold
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1985
The syntactic congruence of L is defined, which is the largest congruences having this property, and it is shown that if L is a rational ω-language, then there exists a finite congruency for which L is saturated in the following sense. Expand
Finite Automata and Unary Languages
  • M. Chrobak
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 1986
Abstract We prove that O(e √ n log n ) states are sufficient to simulate an n -state 1nfa recognizing a unary language by a 1dfa. The lower bound is the same. Similar tight bounds are shown for theExpand
Two-generator semigroups of binary relations☆
Abstract We study upper bounds on the size of the semigroups generated two randomly chosen n × n Boolean matrices having exactly N one entries. In general, as N n increases the semigroups tend to beExpand
A proof of Devadze’s theorem on generators of the semigroup of Boolean matrices
In 1968 Devadze described, without a proof, minimal sets of generators of the semigroup of n×n Boolean matrices. We provide a proof of Devadze’s theorem.
Weak Second‐Order Arithmetic and Finite Automata
The formalism of regular expressions was introduced by S. C. Kleene [6] to obtain the following basic theorems.
Variétés de Semis Groupes et Mots Infinis
La possibilite d'etendre la theorie des varietes de Eilenberg au oas des mots infinis permet egalement de mieux saisir la portee du theoreme de Mac Naughton. Expand