Omega-regular language

The omega-regular languages are a class of omega languages which generalize the definition of regular languages to infinite words. An omega-language L is omega-regular if it has the form Every omega-regular language is accepted by a nondeterministic Büchi automaton; the translation is constructive. Using Büchi automata, it can be proved that if A and B are omega-regular...
Read article at Wikipedia
Edit and Show details

Add or delete facts, expose empty fields, download data in JSON or RDF formats, and explore topic metadata.

Freebase Logo
What is Freebase?

Freebase is a huge collection of facts, built by people like you. Freebase connects facts in ways other sites can't, giving you new ways to explore millions of subjects.
You can help improve it!

Flag this Topic
Why do you want to flag this topic?
Freebase Attribution

Freebase data is free for use under the CC-BY license.

The original description for this topic was automatically generated from the Wikipedia article "Omega-regular language" licensed under the GNU Free Documentation License .
Learn more about Freebase licensing and attribution