Automata and semigroups recognizing infinite words
نویسندگان
چکیده
This paper is a survey on the algebraic approach to the theory of automata accepting infinite words. We discuss the various acceptance modes (Büchi automata, Muller automata, transition automata, weak recognition by a finite semigroup, ω-semigroups) and prove their equivalence. We also give two algebraic proofs of McNaughton’s theorem on the equivalence between Büchi and Muller automata. Finally, we present some recent work on prophetic automata and discuss its extension to transfinite words.
منابع مشابه
Operations on Weakly Recognizing Morphisms
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 f...
متن کاملAutomata and Algebras for Infinite Words and Trees
Regular languages can be studied not just for finite words, but also for finite trees, infinite words and infinite trees. Almost all of the theory of regular languages, such as closure under boolean operations, works also for these extensions, but the constructions are significantly more challenging and mathematically interesting. For instance, automata for infinite words can be determinised un...
متن کاملElementary Theory of Ordinals with Addition and Left Translation by omega
After Büchi it has become very natural to interprete formulae of certain logical theories as finite automata, i.e., as recognizing devices. This recognition aspect though, was neglected by the inventor of the concept and the study of the families of linear structures that could be accepted in the language theory sense of the term, was carried out by other authors. The most popular field of appl...
متن کاملSemigroups with Idempotent stabilizers and Applications to Automata Theory
We show that every finite semigroup is a quotient of a finite semigroup in which every right stabilizer satisfies the identities x = x and xy = xyx. This result has several consequences. We first use it together with a result of I. Simon on congruences on paths to obtain a purely algebraic proof of a deep theorem of McNaughton on infinite words. Next, we give an algebraic proof of a theorem of ...
متن کاملFree profinite locally idempotent and locally commutative semigroups
This paper is concerned with the structure of semigroups of implicit operations on the pseudovariety LSl of finite locally idempotent and locally commutative semigroups. We depart from a general result of Almeida and Weil to give two descriptions of these semigroups: the first in terms of infinite words, and the second in terms of infinite and bi-infinite words. We then derive some applications...
متن کامل