Computer science Automata and formal languages Concept
Omega-regular language
Summary
An omega-regular language is a set of infinite words built from regular languages of finite words by concatenation, infinite repetition and finite unions. These languages are exactly the ones recognized by Büchi automata. They play for infinite words the role that regular languages play for finite words, and they are closed under union, intersection and complement. Omega-regular languages describe the behaviours of non-terminating systems, which is why they are central in verification.
Further reading
About this page
| Tag | G6WP8B6NGD |
|---|---|
| URI | m2://G6WP8B6NGD |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q45, 03D05 |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.