scientific article; zbMATH DE number 5051575
From MaRDI portal
Publication:5486002
zbMath1096.68629MaRDI QIDQ5486002
Publication date: 6 September 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
A note on emptiness for alternating finite automata with a one-letter alphabet ⋮ On history-deterministic one-counter nets ⋮ The complexity of synchronizing Markov decision processes ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Unnamed Item ⋮ Descriptional and Computational Complexity of Finite Automata
This page was built for publication: