THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON
1993 ◽
Vol 03
(02)
◽
pp. 237-250
Keyword(s):
We modify an acceptance condition of Büchi automaton on infinite trees: rather than to require that each computation path is successful, we impose various restrictions on the number of successful paths in a run of the automaton on a tree. All these modifications alter the recognizing power of Büchi automata. We examine the classes induced by the acceptance conditions that require ≤α, ≥α, =α successful paths, where α is a cardinal number. It turns out that, except for some trivial cases, the “≤” classes are incomparable with the class Bü of Büchi acceptable tree languages, while the classes “≥” are strictly included in Bü.
2014 ◽
Vol 25
(08)
◽
pp. 1111-1125
Keyword(s):
Keyword(s):
2018 ◽
Vol 29
(05)
◽
pp. 911-933
Keyword(s):
Keyword(s):
2021 ◽
Keyword(s):