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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1998-2013
0119982013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper uses Walter Benjamin's concept of <i>translation</i> between people and things as a focal point for analysis of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
We investigate expressiveness questions for time Petri nets (TPNs) and some their most usefull extensions. We first introduce… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2010
2010
We show that the bounded fragment of first-order logic and the hybrid language with ‘downarrow’ and ‘at’ operators are equally… (More)
Is this relevant?
2008
2008
Among the many possible approaches to dealing with logical omniscience, I consider here awareness and impossible worlds… (More)
Is this relevant?
2007
2007
We determine the complexity of topological properties (i.e., properties closed under the Wadge equivalence) of regular… (More)
Is this relevant?
2004
2004
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite… (More)
  • figure 1
  • table 1
Is this relevant?
2004
2004
In the literature there are several CCS-like process calculi, or CCS variants, differing in the constructs for the specification… (More)
  • figure 1
  • table 1
Is this relevant?
2003
2003
By applying descriptive set theory to the Wagner’s fine structure of regular ω-languages we get quite different proofs of his… (More)
Is this relevant?
2001
2001
One way to understand an interactive system is firmly rooted in language theory, that a system is its set of runs (or words… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1998
1998
In concurrency theory, there are several examples where the interleaved model of concurrency can distinguish between execution… (More)
  • figure 1
Is this relevant?