Büchi automata
E1358932
UNEXPLORED
Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Büchi automata canonical | 2 |
| Büchi automaton | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T19111986 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Büchi automata Context triple: [linear temporal logic, isRelatedTo, Büchi automata]
-
A.
Rabin–Scott powerset construction
The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
-
B.
Rabin automaton
A Rabin automaton is a type of ω-automaton used in formal verification and automata theory to recognize sets of infinite sequences via Rabin acceptance conditions.
-
C.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
D.
Decision Problems in the Theory of Automata
"Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
-
E.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Büchi automata Target entity description: Büchi automata are a type of ω-automaton used to recognize languages of infinite words, playing a central role in the automata-theoretic approach to model checking and the semantics of linear temporal logic.
-
A.
Rabin–Scott powerset construction
The Rabin–Scott powerset construction is a fundamental algorithm in automata theory that converts nondeterministic finite automata (NFAs) into equivalent deterministic finite automata (DFAs) by using sets of states as single states.
-
B.
Rabin automaton
A Rabin automaton is a type of ω-automaton used in formal verification and automata theory to recognize sets of infinite sequences via Rabin acceptance conditions.
-
C.
Finite Automata and Their Decision Problems
"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.
-
D.
Decision Problems in the Theory of Automata
"Decision Problems in the Theory of Automata" is the doctoral thesis of computer scientist Amir Pnueli, focusing on foundational questions about the solvability and complexity of problems related to automata theory.
-
E.
Automata and Computability (textbook)
Automata and Computability is a widely used theoretical computer science textbook by Dexter Kozen that introduces formal languages, automata theory, and the foundations of computability.
- F. None of above. chosen
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Büchi automata
linked to: Büchi automata