Alternating nonzero automata

DOI10.4230/LIPICS.CONCUR.2018.13MaRDI QIDQ5009427zbMATH OpenFDO

Authors Paulin Fournier, Hugo Gimbert

Publication date 4 August 2021

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

zbMATH Keywords

probabilitiestemporal logicszero-automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Emptiness of zero automata is decidable
• Publication:4542592
• Emptiness Of Alternating Tree Automata Using Games With Imperfect Information
• Alternating automata on infinite trees
• Publication:3739111

Cites work

• scientific article; zbMATH DE number 7168170 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• A logic for reasoning about time and reliability
• Alternating automata on infinite trees
• Alternation
• An automata-theoretic approach to branching-time model checking
• Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
• Emptiness of zero automata is decidable
• Measure quantifier in monadic second order logic
• Probabilistic automata
• Probabilistic ω-automata
• Randomization in automata on infinite trees
• Reasoning with time and chance
• Thin MSO with a probabilistic path quantifier
• “Sometimes” and “not never” revisited

Cited in

(6)

• An alternating hierarchy for finite automata
• scientific article; zbMATH DE number 1759428 (Why is no real title available?)
• Alternating Weighted Automata
• Alternating finite automata and star-free languages
• ALTERNATING TURING MACHINES WITH MODIFIED ACCEPTING STRUCTURE
• Emptiness of zero automata is decidable

This page was built for publication: Alternating nonzero automata

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