In automata theory, quantum computation has been widely examined for finite state machines, known as quantum finite automata (QFAs), and less attention has been given to QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of QFAs where the input head operates in one-way or realtime mode, and present some new results regarding their superiority over their classical counterparts. Our first result is about the nondeterministic acceptance mode: Each quantum model...
In automata theory, quantum computation has been widely examined for finite state
machines, known as quantum finite automata (QFAs), and less attention has been given to
QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of
QFAs where the input head operates in one-way or realtime mode, and present some new
results regarding their superiority over their classical counterparts. Our first result is
about the nondeterministic...
In automata theory, quantum computation has been widely examined for finite state
machines, known as quantum finite automata (QFAs), and less attention has been given to
QFAs augmented with counters or stacks. In this paper, we focus on such generalizations of
QFAs where the input head operates in one-way or realtime mode, and present some new
results regarding their superiority over their classical counterparts. Our first result is
about the nondeterministic...
Download Results (CSV)