Displaying similar documents to “Superiority of one-way and realtime quantum machines∗∗∗”

Superiority of one-way and realtime quantum machines

Abuzer Yakaryılmaz (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

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...

Superiority of one-way and realtime quantum machines

Abuzer Yakaryılmaz (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

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...

On biautomata

Ondřej Klíma, Libor Polák (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

We initiate the theory and applications of biautomata. A biautomaton can read a word alternately from the left and from the right. We assign to each regular language its canonical biautomaton. This structure plays, among all biautomata recognizing the language , the same role as the minimal deterministic automaton has among all deterministic automata recognizing the language . We expect that from the graph structure of this automaton one could decide the membership of a given language...

Affine Parikh automata

Michaël Cadilhac, Alain Finkel, Pierre McKenzie (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the , that extends the PA by having each transition induce an affine transformation on the PA registers, and the , that restricts the PA by forcing any two transitions...

Affine Parikh automata

Michaël Cadilhac, Alain Finkel, Pierre McKenzie (2012)

RAIRO - Theoretical Informatics and Applications

Similarity:

The Parikh finite word automaton (PA) was introduced and studied in 2003 by Klaedtke and Rueß. Natural variants of the PA arise from viewing a PA equivalently as an automaton that keeps a count of its transitions and semilinearly constrains their numbers. Here we adopt this view and define the , that extends the PA by having each transition induce an affine transformation on the PA registers, and the , that restricts the PA by forcing any two transitions...