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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(82)90097-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2167227381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3922660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ω-regular sets / rank
 
Normal rank

Latest revision as of 10:24, 17 June 2024

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
    deterministic sinking automaton
    0 references

    Identifiers