J. Pin. On the languages accepted by finite reversible automata. Lecture Notes in Computer Science, vol. 267, 237-249, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Characterizations of 1-Way Quantum Finite Automata - Brodsky, Pippenger (1 citation) (Correct)
....q 0 2 Q such that ffi (q 0 ; oe) q, or, if there exist distinct states q 1 ; q 2 2 Q and symbol oe 2 Sigma such that ffi (q 1 ; oe) q = ffi (q 2 ; oe) then ffi (q; Sigma) fqg. This definition is equivalent to the one used by Ambainis and Freivalds[AF98] and is an extension of Pin s[Pin87] definition. 2.5 Previous Work Moore and Crutchfield[MCar] introduced a variant of the MO QFA model and investigated the model in terms of quantum regular languages (QRLs) They showed several closure properties including closure under inverse homomorphisms and derived a method for ....
J. Pin. On languages accepted by finite reversible automata. In Proceedings of the 14th International Colloquium on Automata, Languages and Programming, volume 267 of Lecture Notes on Computer Science, pages 237--249, 1987.
On the Power of Quantum Finite State Automata - Kondacs, Watrous (1997) (19 citations) (Correct)
....case. A corollary of 2 is that reversible 2 way finite state automata are equivalent in power to (1 way or 2 way) deterministic finite state automata. This is in contrast to the fact that 1 way reversible finite state automata are known to be less powerful than deterministic finite state automata [19]. In this paper, we also prove an elementary result regarding 1qfa s; similar to 1 way reversible finite state automata, 1qfa s are strictly less powerful than 1 way deterministic, nondeterministic and probabilistic finite state automata (1dfa s, 1nfa s and 1pfa s) The fact that bounded error ....
J. Pin. On the languages accepted by finite reversible automata. In 14th International Colloquium on Automata, Languages and Programming, volume 267 of Lecture Notes in Computer Science, pages 237--249. Springer-Verlag, 1987.
On the Power of 2-Way Quantum Finite State Automata - Watrous (1997) (Correct)
....a corollary of 2, we have that reversible 2 way finite state automata are equivalent in power to (1 way or 2 way) deterministic finite state automata. This is in contrast to the fact that 1 way reversible finite state automata are known to be less powerful than deterministic finite state automata [19]. The remainder of this paper has the following organization. In Section 2, we define 2 way quantum finite state automata, and in Section 3 we provide a well formedness criterion for 2qfa s and discuss a method by which well formed 2qfa s can be easily specified. In Section 4, we present bounded ....
J. Pin. On the languages accepted by finite reversible automata. In 14th International Colloquium on Automata, Languages and Programming, volume 267 of Lecture Notes in Computer Science, pages 237--249. Springer-Verlag, 1987.
Size of Finite Probabilistic and Quantum Automata - Bonner, Freivalds, Rasscevskis (2002) (Correct)
No context found.
J. Pin. On the languages accepted by finite reversible automata. Lecture Notes in Computer Science, vol. 267, 237-249, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC