Codeterministic automata on infinite words
From MaRDI portal
Publication:1061501
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
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
This page was built for publication: Codeterministic automata on infinite words