Publication:5486002
From MaRDI portal
zbMath1096.68629MaRDI QIDQ5486002
Publication date: 6 September 2006
Related Items
Unnamed Item, On history-deterministic one-counter nets, Descriptional and computational complexity of finite automata -- a survey, The complexity of synchronizing Markov decision processes, A note on emptiness for alternating finite automata with a one-letter alphabet, Descriptional and Computational Complexity of Finite Automata