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.
2018
2018
A regular language is almost fully characterized by its right congruence relation. Indeed, a regular language can always be… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2018
2018
In combinatorics of words, a concatenation of k consecutive equal blocks is called a power of order k. In this paper we take a… Expand
  • figure 1
2012
2012
  • O. Finkel
  • Int. J. Found. Comput. Sci.
  • 2012
  • Corpus ID: 8788479
It was noticed by Harel in [Har86] that "one can define -complete versions of the well-known Post Correspondence Problem". We… Expand
2010
2010
  • P. Salimov
  • Discret. Math. Theor. Comput. Sci.
  • 2010
  • Corpus ID: 8641525
The direct product of two words is a naturally defined word on the alphabet of pairs of symbols. An infinite word is uniformly… Expand
2009
2009
  • S. Elizalde
  • SIAM J. Discret. Math.
  • 2009
  • Corpus ID: 17433219
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
2001
2001
Valuations?morphisms from (?*, ·, e) to ((0, ∞), ·, 1)?are a generalization of Bernoulli morphisms introduced by Eilenberg… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1997
Highly Cited
1997
The Department of Languages provides a vital component in the undergraduate liberal arts education offered at the University of… Expand
Highly Cited
1995
Highly Cited
1995
Infinite two-person games are a natural framework for the study of reactive nonterminating programs. The effective construction… Expand
Highly Cited
1993
Highly Cited
1993
For ω-languages several notions of syntactic congruence were defined. The present paper investigates relationships between the so… Expand
1987
1987
  • A. Grazon
  • Inf. Process. Lett.
  • 1987
  • Corpus ID: 11081250
Abstract The complement of the set of left factors of an infinite word satisfies the iteration lemma for context-free languages… Expand