Category
page 1Infinite words
Büchi automaton
automaton which either accepts or rejects infinite inputs
ω-automaton
In automata theory, a branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of a finite automaton that runs on infinite, rather than finite, strings as input. Since ω-automata do not stop, they have a variety of acceptance conditions rather than simply a set of accepting states.
Muller automaton
omega-regular language
omega language
mathematical concept
Sturmian word
mathematical sequence of characters