Codeterministic automata on infinite words

DOI10.1016/0020-0190(85)90071-7zbMath0571.68073OpenAlexW2038787784MaRDI QIDQ1061501

Dominique Perrin, Danièle Beauquier

Publication date: 1985

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

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

zbMATH Keywords

finite automatonrecognizable set of infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Linear numeration systems, θ-developments and finite automata ⋮ Unambiguous Büchi automata. ⋮ The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction ⋮ Varieties of finite monoids and Büchi-McNaughton theorem ⋮ Confluent linear numeration systems

Cites Work

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

This page was built for publication: Codeterministic automata on infinite words