Characterizations Of Quantum Automata

Elsevier Science Bv
Publication Type:
Journal Article
Theoretical Computer Science, 2004, 312 (2-3), pp. 479 - 489
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2008004764OK.pdf223.51 kB
Adobe PDF
We define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and verify that they are exactly equivalent to those measure-once quantum finite automata (MO-QFAs) in the literature. In particular, we define q quantum pushdown automat
Please use this identifier to cite or link to this item: