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

DOI10.1016/0020-0190(82)90097-7zbMath0582.68023OpenAlexW2167227381MaRDI QIDQ1068544

A. Włodzimierz Mostowski

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90097-7

zbMATH Keywords

deterministic sinking automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Unambiguous Büchi automata. ⋮ Generalized automata on infinite trees and Muller-McNaughton's theorem ⋮ Automata on infinite objects and their applications to logic and programming ⋮ Automata on infinite trees ⋮ Codeterministic automata on infinite words

Cites Work

• Unnamed Item
• Unnamed Item
• On ω-regular sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Determinacy of sinking automata on infinite trees and inequalities between various Rabin's pair indices