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.

Questions about ω-languages, i.e. about sets of infinite-length sequences of symbols.

Similar to the more familiar languages of finite words, an ω-language is a set of infinite words, or ω-words. Alternatively to an infinite-length sequence of symbols, an ω-word can be seen as a map that assigns a symbol to every natural number.

Typical examples of ω-languages studied in the literature include ω-regular languages, which are accepted by nondeterministic Büchi automata, or languages accepted by deterministic Büchi automata.