Quantum Finite One-Counter Automata

Details Quantum Finite One-Counter Automata Quantum Finite One-Counter Automata

1999-05-27

arxiv.org/abs/quant-ph/9905092v1

Physics

Quantum Physics

11 pages, Postscript

Scientific paper

In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A.Kondacs and J.Watrous. The well-formedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. That allows to specify rules for constructing such automata more naturally and simpler than in general case. Possible models of language recognition by QF1CA are considered. The recognition of some languages by QF1CA is shown and compared with recognition by probabilistic counterparts.

Affiliated with

Also associated with

No associations

Rating

Quantum Finite One-Counter Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum Finite One-Counter Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Finite One-Counter Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-54487