Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (Q1068544)

From MaRDI portal
Revision as of 03:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices
scientific article

    Statements

    Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (English)
    0 references
    1982
    0 references
    Let a set of infinite trees be accepted by an automaton. We prove that then a deterministic sinking automaton accepting the set can be effectively constructed.
    0 references
    0 references
    deterministic sinking automaton
    0 references