scientific article; zbMATH DE number 5051575

zbMATH Open1096.68629MaRDI QIDQ5486002FDOQ5486002

Markus Holzer

Publication date: 6 September 2006

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (11)

• A note on the emptiness problem for alternating finite-memory automata
• Title not available (Why is that?)
• The complexity of synchronizing Markov decision processes
• Descriptional and Computational Complexity of Finite Automata
• A note on emptiness for alternating finite automata with a one-letter alphabet
• Title not available (Why is that?)
• Title not available (Why is that?)
• Alternating finite automata on \(\omega\)-words
• Parity games on temporal graphs
• On history-deterministic one-counter nets
• Descriptional and computational complexity of finite automata -- a survey

This page was built for publication:

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