Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02807030n
Noun Concept
Categories: Model checking, Finite automata
EN
Büchi automaton  Buchi automata  Buchi automaton  Buechi automata  Buechi automaton
EN
In computer science and automata theory, a deterministic Büchi automaton is a theoretical machine which either accepts or rejects infinite inputs. Wikipedia
Definitions
Relations
Sources
EN
In computer science and automata theory, a deterministic Büchi automaton is a theoretical machine which either accepts or rejects infinite inputs. Wikipedia
Finite state automata extended to infinite inputs Wikipedia Disambiguation
Automaton which either accepts or rejects infinite inputs Wikidata
A type of ω-automaton that extends a finite automaton to infinite inputs. It accepts an infinite input sequence if there exists a run of the automaton that visits (at least) one of the final states infinitely often. Wiktionary
IS A
ω-automaton
DISCOVERER OR INVENTOR
Julius Richard Büchi
NAMED AFTER
Julius Richard Büchi
Wikipedia
EN
Büchi automaton
Wikidata
EN
Büchi automaton
Wiktionary
EN
Büchi automaton
Wikipedia Redirections
EN
Buchi automata, Buchi automaton, Buechi automata, Buechi automaton, Büchi automata
Wikidata Alias
EN
Büchi automata

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License