Emptiness of zero automata is decidable

DOI10.4230/LIPICS.ICALP.2017.106zbMATH Open1442.68084arXiv1702.06858MaRDI QIDQ5111438FDOQ5111438

Edon Kelmendi, Hugo Gimbert, Mikołaj Bojańczyk

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1702.06858

Recommendations

• scientific article; zbMATH DE number 7168170
• Alternating nonzero automata
• When are emptiness and containment decidable for probabilistic automata?
• Probabilistic automata on finite words: decidable and undecidable problems
• Deciding emptiness for stack automata on infinite trees

zbMATH Keywords

probabilistic automatamonadic second-order logictree automata

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 (3)

• Title not available (Why is that?)
• Monadic Second Order Logic with Measure and Category Quantifiers
• Title not available (Why is that?)

This page was built for publication: Emptiness of zero automata is decidable

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