Alternating, private alternating, and quantum alternating realtime automata
We present new results on realtime alternating, private alternating, and quantum alternating automaton models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we present two equivalent definitions of realtime private alternati...
| المؤلفون الرئيسيون: | , , , , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Logical Methods in Computer Science e.V.
2019-08-01
|
| سلاسل: | Logical Methods in Computer Science |
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://lmcs.episciences.org/4664/pdf |