As of May 31, 2023, we have updated our Code of Conduct.

Questions tagged [omega-language]

Questions about ω-languages, i.e. about sets of infinite-length sequences of symbols. Typical examples include ω-regular languages or languages accepted by deterministic Büchi automata. The tag can also be used for questions about languates over ω-trees.

Filter by
Sorted by
Tagged with
9 votes
1 answer
522 views

Measurable language which is not $\omega$-regular

Let $\Sigma$ be a finite alphabet and let $\Sigma^\omega$ be the set of all infinite words over $\Sigma$. Consider $$ d(x,y):=2^{-\min(n \in \Bbb N_0:x_n\neq y_n)} $$ to be the metric on $\Sigma^\...
SBF's user avatar
  • 407