Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices (Q1068544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices |
scientific article; zbMATH DE number 3932393 |
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
0 references
