Search
Browse
Shopping Cart
Upload
Settings
Help
Previous Version
Terminology
DBW-Recognizable
A language is
DBW-recognizable
if it can be recognized by some deterministic Büchi automaton.
An automaton is classified as
DBW-recognizable
if the language it recognizes is
DBW-recognizable
.