Quantum Automata and Quantum Grammars

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages

Scientific paper

To study quantum computation, it might be helpful to generalize structures from language and automata theory to the quantum case. To that end, we propose quantum versions of finite-state and push-down automata, and regular and context-free grammars. We find analogs of several classical theorems, including pumping lemmas, closure properties, rational and algebraic generating functions, and Greibach normal form. We also show that there are quantum context-free languages that are not context-free.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Quantum Automata and Quantum Grammars 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 Automata and Quantum Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Automata and Quantum Grammars will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-265975

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.