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

Omega language

Known as: Infinite word, Omega (disambiguation), Ω-language 
An ω-language is a set of infinite-length sequences of symbols.
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
A generalized lexicographic order on words is a lexicographic order where the total order of the alphabet depends on the position… Expand
  • figure 1
Is this relevant?
2016
2016
Abstract We provide an algorithm for learning an unknown regular set of infinite words using membership and equivalence queries… Expand
  • figure 1
  • table 1
Is this relevant?
2010
2010
The direct product of two words is a naturally defined word on the alphabet of pairs of symbols. An infinite word is uniformly… Expand
Is this relevant?
2010
2010
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to… Expand
Is this relevant?
2009
2009
A permutation $\pi$ is realized by the shift on $N$ symbols if there is an infinite word on an $N$-letter alphabet whose… Expand
  • figure 1.1
  • table 3.1
  • figure 3.1
Is this relevant?
2009
2009
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only… Expand
Is this relevant?
2007
2007
We consider the following decision problem: “Is a rational ω-language generated by a code ?” Since 1994, the codes admit a… Expand
  • table 1
  • figure 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a technique for generating efficient monitors for ω-regular-languages. We show how Büchi automata can be reduced in… Expand
  • figure 2
  • table 2
Is this relevant?
1993
1993
For ω-languages several notions of syntactic congruence were defined. The present paper investigates relationships between the so… Expand
Is this relevant?
1987
1987
Abstract The complement of the set of left factors of an infinite word satisfies the iteration lemma for context-free languages… Expand
Is this relevant?