Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,060,763 papers from all fields of science
Search
Sign In
Create Free Account
Weak Büchi automaton
Known as:
Weak Buchi automaton
In computer science and automata theory, a Weak Büchi automaton is a formalism which represents a set of infinite words. A Weak Büchi automaton is a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Automata theory
Büchi automaton
Co-Büchi automaton
Computer science
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Minimization and Learning in the class DWBA
Nicolas Basset
,
M. Leucker
2007
Corpus ID: 15716732
In this paper, we give a characterization based on Nerode’s right congruence of DWBA which is the subclass of ω-regular languages…
Expand