Co-Büchi automaton
ConceptComputer Science Concepts
An automaton accepting runs eventually confined to final states
1.00Common
Common
Co-Büchi automaton
- Computer Science Concepts
In automata theory, a co-Büchi automaton is a variant of a Büchi automaton with a different accepting condition. It accepts an infinite word if there is a run in which every state occurring infinitely often belongs to the final state set. By contrast, Büchi automata require final states to be visited infinitely often. Deterministic co-Büchi automata are strictly weaker than nondeterministic Büchi automata.
The picture on this card was made with AI. It is an illustration, not a real photo of the subject.
- Field
- Automata theory
- Relative expressive power
- Deterministic co-Büchi automata are strictly weaker than nondeterministic Büchi automata
Sources and credits
Sources and credits
- Article
- Co-Büchi automaton (English Wikipedia)
- Wikidata
- Q5137398
- Text
- Card text is adapted from the English Wikipedia article by an automated summary. Wikipedia content is available under CC BY-SA 4.0; see the article history for its contributors. CC BY-SA 4.0 · Article history and contributors
- Illustration
- AI-generated illustration. Not a photograph or documentary image. (model: gpt-image-2.5-flare)
- Popularity
- 1 median daily views (Wikimedia Pageviews API (all-access, user agent))
Kosmora is not affiliated with or endorsed by the Wikimedia Foundation.