Explore relationships

Omega-regular language

In computer science and formal language theory, the ω-regular languages are a class of ω-languages that generalize the definition of regular languages to infinite words.

Use + to expand a branch. Click a topic name to open its summary.