Büchi automaton
Sign in to saveAlso known as Büchi automata
automaton which either accepts or rejects infinite inputs
In the Vinony graph
Within Vinony's link graph, Büchi automaton is referenced by 30 other articles, and connects out to finite-state machine, regular language and Moshe Vardi.
It sits within the topics Finite-state machines, Infinite words and Model checking.
Its subject is documented across 11 Wikipedia language editions.
Wikidata facts
Show 1 more fact
- Commons category
- Büchi automaton
Sources (3)
via Wikidata · CC0
Connections
finite-state machine
Entity
regular language
Entity
Moshe Vardi
Entity
ω-automaton
Entity
omega-regular language
Entity
computer science
Entity
International Standard Book Number
Entity
digital object identifier
Entity
empty set
Entity
Turing machine
Entity
subset
Entity
Q118398
Entity
equivalence relation
Entity
formal language
Entity
finite set
Entity
if and only if
Entity
automata theory
Entity
depth-first search
Entity
Chomsky hierarchy
Entity
Q22908627
Entity