Computer science Automata and formal languages Concept
Büchi automaton
Summary
A Büchi automaton is a finite automaton that reads infinite words. It accepts an infinite word when some run on it passes through an accepting state infinitely often. Nondeterministic Büchi automata recognize exactly the omega-regular languages. They are a main tool in model checking, where formulas of linear temporal logic are translated into them. Unlike for finite words, deterministic Büchi automata are weaker than nondeterministic ones.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 92DM43HQZT |
|---|---|
| URI | m2://92DM43HQZT |
| 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.