On emptiness and counting for alternating finite automata

MaRDI QIDQ5486002zbMATH OpenFDO

Authors Markus Holzer

Publication date 6 September 2006

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A note on emptiness for alternating finite automata with a one-letter alphabet
• scientific article; zbMATH DE number 3911710
• scientific article; zbMATH DE number 7104930
• Empty alternation
• scientific article; zbMATH DE number 4213434

Cited in

(15)

• A note on the emptiness problem for alternating finite-memory automata
• Alternating and empty alternating auxiliary stack automata.
• The complexity of synchronizing Markov decision processes
• The state complexity of alternating automata
• Descriptional and Computational Complexity of Finite Automata
• Game characterization of probabilistic bisimilarity, and applications to pushdown automata
• A note on emptiness for alternating finite automata with a one-letter alphabet
• scientific article; zbMATH DE number 1759428 (Why is no real title available?)
• scientific article; zbMATH DE number 7168170 (Why is no real title available?)
• Alternating finite automata on -words
• Parity games on temporal graphs
• The emptiness problem for intersections of regular languages
• On history-deterministic one-counter nets
• Descriptional and computational complexity of finite automata -- a survey
• Empty alternation

This page was built for publication: On emptiness and counting for alternating finite automata

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