On omega-Regular Sets

  title={On omega-Regular Sets},
  author={K. Wagner},
  journal={Inf. Control.},
  • K. Wagner
  • Published 1979
  • Computer Science, Mathematics
  • Inf. Control.
The investigation of the acceptional power of finite automata with respect to several notions of acceptance for ω-sets, done in the literature, has exhibited six subclasses of the class of ω-regular sets. These classes are well characterized by means of topology and set representation. First we give an overview of these results. The main aim of this paper is the investigation of further natural subclasses of the class of ω-regular sets. We define such subclasses by three methods: by the… Expand
Structural Complexity of Omega-Automata
This paper relates expressiveness of ω-automata to their complexity and identifies a strict hierarchy of languages induced by restricting the number of pairs allowed in a deterministic Rabin automaton (DRA). Expand
Finite-State omega-Languages
  • L. Staiger
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1983
The main tool in the proof of this statement the so-called normal form decomposition of finite-state ω-languages also provides a solution to the minimization problem of finite automata accepting ω -languages. Expand
X-Automata on omega-Words
The main tools for this investigation are a characterization of the ω-languages accepted by X -automata in terms of inverse X -transductions of finite-state ω -languages and the existence of topological upper bounds on some of the families of accepted υ-l languages (independent of the storage type X). Expand
Accepting Conditions for Automata on omega-Languages
Abstract In this paper we study the ω-languages accepted by finite automata under a new type of accepting conditions which are based on whether the automaton enters all of its accepting statesExpand
The Missing Link for omega-rational Sets, Automata, and Semigroups
A third notion is introduced that completes the task undertaken by Olivier Carton and Dominique Perrin on chains and superchains for ω-semigroups and describes the whole Wagner hierarchy. Expand
On the learnability of infinitary regular sets
In this paper we extend the automaton synthesis paradigm to infinitary languages, that is, to subsets of the set ∑ ω of all infinite sequences over some alphabet ∑. Our main result is a polynomialExpand
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
Complexity of Topological Properties of Regular omega-Languages
The complexity of topological properties of regular ω-languages is determined by showing that they are typically NL-complete (PSPACE-complete) for the deterministic Muller, Mostowski and Buchi automata. Expand
Logical Specifications of Infinite Computations
The automaton theoretic approach to logical specifications over ω-words turns out to be a technique to reduce quantifier complexity of formulas. Expand
Finite Acceptance of Infinite Words
Two types of finite acceptance of infinite words by finite automata are considered: an infinite word ξ is accepted if and only if there is a run on input ξ for which an accepting state is visited at least once but only finitely often. Expand


Theories of Automata on omega-Tapes: A Simplified Approach
  • Y. Choueka
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1974
Using a combinatorial lemma on regular sets, and a technique of attaching a control unit to a parallel battery of finite automata, a simple and transparent development of McNaughton's theory ofExpand
Infinite sequences and finite machines
A regular set is a set of possible state sequences of an inputless, nondeterministic machine that may either terminate in some equilibrium condition, or else the machine may pass from one state to another without ever reaching equ~librium. Expand
Testing and Generating Infinite Sequences by a Finite Automaton
Two apparently divergent areas of inquiry should give rise to the same problem, namely, that of describing the infinite history of finite automata, and it is this problem to which the remainder of this paper will address itself. Expand
Solving sequential conditions by finite-state strategies
Our main purpose is to present an algorithm which decides whether or not a condition 𝕮(X, Y) stated in sequential calculus admits a finite automata solution, and produces one if it exists. ThisExpand
Definability in the Monadic Second-Order Theory of Successor
D is a relational system whereby D is a nonempty set and P i is an m i-ary relation on D and the (weak) monadic second-order theory (W)MT[D] consisting of the first-order predicate calculus with individual variables ranging over D; monadic predicate variablesranging over (finite) subsets of D; and constants corresponding to P 1, P 2, ⋯. Expand
Eine topologische Charakterisierung einiger Klassen regulärer Folgenmengen
  • K. W. Wagner
  • Mathematics, Computer Science
  • J. Inf. Process. Cybern.
  • 1977
Infinite Strings Over Finite Machines