Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,759,090 papers from all fields of science
Search
Sign In
Create Free Account
Omega language
Known as:
Infinite word
, Omega (disambiguation)
, Ω-language
An ω-language is a set of infinite-length sequences of symbols.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Automata theory
Büchi automaton
David E. Muller
Decision problem
Expand
Broader (1)
Theory of computation
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Critical Exponent of Infinite Words Coding Beta-Integers Associated with Non-Simple Parry Numbers
L. Balkov'a
,
K. Klouda
,
E. Pelantov'a
Integers
2010
Corpus ID: 51758466
In this paper, we study the critical exponent of infinite words $\ubeta$ coding $\beta$-integers for $\beta$ being a~non-simple…
Expand
2008
2008
On stabilizers of infinite words
D. Krieger
Theoretical Computer Science
2008
Corpus ID: 17404840
2007
2007
Reduced languages as ω-generators
Sandrine Julia
,
Tran Vinh Duc
2007
Corpus ID: 7436195
We consider the following decision problem: "Is a rational w-language generated by a code?" Since 1994, the codes admit a…
Expand
2007
2007
Algorithmic Analysis of Piecewise FIFO Systems
N. Ghafari
,
A. Gurfinkel
,
Nils Klarlund
,
Richard J. Trefler
Formal Methods in Computer-Aided Design
2007
Corpus ID: 1316156
Systems consisting of several components that communicate via unbounded perfect FIFO channels (i.e. FIFO systems) arise naturally…
Expand
2007
2007
PALINDROMES AND PSEUDO-PALINDROMES IN EPISTURMIAN AND PSEUDO-PALINDROMIC INFINITE WORDS
Vyoma Anne
,
L. Zamboni
2007
Corpus ID: 17802824
Let A be a finite set of cardinality greater or equal to 2. An infinite word ω ∈ AN is called Episturmian if it is closed under…
Expand
2005
2005
Languages of finite words occurring infinitely many times in an infinite word
K. Thomsen
RAIRO - Theoretical Informatics and Applications
2005
Corpus ID: 7949405
We give necessary and sufficient conditions for a language to be the language of finite words that occur infinitely many times in…
Expand
1993
1993
On the Limit Set of Some Universal Cellular Automata
E. Ch.
,
A. Maass
,
A. ServetMartínez
Theoretical Computer Science
1993
Corpus ID: 35396974
1991
1991
On ω-controllability and ω-normality of deds
Ratnesh Kumar
,
V. Garg
,
S. Marcus
American Control Conference
1991
Corpus ID: 37335358
In this paper, we address the supervisory synthesis problem for controlling the sequential behaviors of Discrete Event Dynamical…
Expand
Review
1989
Review
1989
Properties of Infinite Words: Recent Result
J. Berstel
Symposium on Theoretical Aspects of Computer…
1989
Corpus ID: 35727898
In this survey, two problems are considered. The first is to determine conditions on an infinite word such that the set of…
Expand
1988
1988
Computation tree logic and regular omega-languages
W. Thomas
REX Workshop
1988
Corpus ID: 32327876
The expressive power of branching time logics is studied in the framework of the theory of ω-automata and ω-languages. The…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE