Decidability conditions for problems about automata reading infinite words

zbMATH Open1324.03011MaRDI QIDQ5263763FDOQ5263763

Authors: Mikhail Vyalyi, Alexander A. Rubtsov 

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da679

Recommendations

• Probabilistic automata on infinite words: decidability and undecidability results
• Decidable problems for probabilistic automata on infinite words
• Infinity problems and countability problems for \(\omega \)-automata
• Codeterministic automata on infinite words
• scientific article; zbMATH DE number 3972187

zbMATH Keywords

regular languagemonadic theoryalgorithmic decidabilityinfinite word

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (2)

• Automata transformations of prefix decidable and decidable by Buchi superwords
• The structure of degrees of finite-automaton transformations of prefix decidable superwords

This page was built for publication: Decidability conditions for problems about automata reading infinite words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5263763)