An ω-language is a set of infinite-length sequences of symbols.

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
- 2015 30th Annual ACM/IEEE Symposium on Logic in…
- 2015

Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While… (More)

Is this relevant?

2009

2009

- Rajeev Alur, Aldric Degorre, Oded Maler, Gera Weiss
- FOSSACS
- 2009

In quantitative verification, system states/transitions have associated payoffs, and these are used to associate mean-payoffs… (More)

Is this relevant?

2006

2006

- Lubomíra Balková, Edita Pelantová, Wolfgang Steiner
- ArXiv
- 2006

An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian… (More)

Is this relevant?

2005

2005

- Marcelo d’Amorim
- 2005

We present a technique for generating efficient monitors for ω-regular-languages. We show how Büchi automata can be reduced in… (More)

Is this relevant?

2004

2004

A set of words X is called unavoidable on a given alphabet A if every infinite word on A has a factor in X. For k, q ≥ 1, let c(k… (More)

Is this relevant?

2004

2004

- Olivier Finkel
- Theor. Comput. Sci.
- 2004

Locally finite ω-languages, defined via second order quantifications followed by a first order locally finite sentence, were… (More)

Is this relevant?

2000

2000

- Jacques Justin, Laurent Vuillon
- ITA
- 2000

Considering each occurrence of a word w in a recurrent infinite word, we define the set of return words of w to be the set of all… (More)

Is this relevant?

1992

1992

We address the supervisory synthesis problem for controlling the sequential behaviors of Discrete Event Dynamical Systems (DEDS’s… (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Filippo Mignosi, Giuseppe Pirillo
- ITA
- 1992

Let <p be the golden number; we prove that the Fibonacci infinité word contains no frac tional power with exponent greater than 2… (More)

Is this relevant?

1983

1983

- Jean-Jacques Pansiot
- Acta Informatica
- 1983

Nous définissons des ensembles de mots infinis engendrés par différentes classes de tag-systèmes. Nous montrons que tout mot… (More)

Is this relevant?