Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Omega-regular language

Known as: Omega-regular expression, Omega-regular languages, Ω-regular language 
The ω-regular languages are a class of ω-languages which generalize the definition of regular languages to infinite words. Büchi showed in 1962 that… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Arguably, omega-regular languages play an important role as a specification formalism in many approaches to systems monitoring… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
A new class of languages of infinite words is introduced, called the max-regular languages, extending the class of ω-regular… Expand
Is this relevant?
2010
2010
The paper presents some automata and logics on $\omega$-words, which capture all $\omega$-regular languages, and yet still have… Expand
Is this relevant?
2009
2009
In this paper, we consider several subclasses of distributed schedulers and we investigate the ability of these subclasses to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
 
Is this relevant?
2004
2004
This paper continues the algebraic theory of Esik, Kuich [9] on semiring-semimodule pairs and quemirings that is applicable to… Expand
Is this relevant?
1999
1999
Abstract A simple extension of the propositional temporal logic of linear time is proposed. The extension consists of… Expand
Is this relevant?
1988
1988
The expressive power of branching time logics is studied in the framework of the theory of ω-automata and ω-languages. The… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
  • D. Park
  • Theoretical Computer Science
  • 1981
  • Corpus ID: 206841958
The paper is concerned with ways in which fair concurrency can be modeled using notations for omega-regular languages - languages… Expand
Is this relevant?