Quantum versus deterministic counter automata

No abstract is available for this paper.

• Publication year

  2002

• Venue

  Theoretical Computer Science

• Publication date

  2002-08-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.tcs.2004.07.034
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dense quantum coding and quantum finite automata

  2002cited by this paper
• Quantum versus Probabilistic One-Way Finite Automata with Counter

  2001influential reference
• Exact results for accepting probabilities of quantum automata

  2001cited by this paper
• On the Lower Bounds for One-Way Quantum Automata

  2000cited by this paper
• On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

  2000cited by this paper
• Quantum Pushdown Automata

  2000cited by this paper
• One-way probabilistic reversible and quantum one-counter automata

  2000cited by this paper
• Quantum Finite State Transducers

  2000cited by this paper
• Quantum Finite Multitape Automata

  1999cited by this paper
• Undecidability on quantum finite automata

  1999cited by this paper
• Optimal lower bounds for quantum automata and random access codes

  1999influential reference
• Quantum Finite One-Counter Automata

  1999influential reference
• Characterizations of 1-Way Quantum Finite Automata

  1999cited by this paper
• Probabilities to Accept Languages by Quantum Finite Automata

  1999cited by this paper
• Two-way finite automata with quantum and classical state

  1999cited by this paper
• 1-way quantum finite automata: strengths, weaknesses and generalizations

  1998cited by this paper
• Quantum automata and quantum grammars

  1997cited by this paper
• Reversible space equals deterministic space

  1997cited by this paper
• On the power of quantum finite state automata

  1997cited by this paper
• Universality of a Reversible Two-Counter Machine

  1996cited by this paper
• Two-way counter machines and Diophantine equations

  1981cited by this paper
• Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines

  1961cited by this paper

• Notes on Stack Machines and Quantum Stack Machines

  2025cites this paper
• Quantum Pushdown Automata with Garbage Tape

  2018cites this paper
• New results on classical and quantum counter automata

  2014cites this paper
• Classical and Quantum Counter Automata on Promise Problems

  2014cites this paper
• Quantum Pushdown Automata with a Garbage Tape

  2014cites this paper
• Non-trivial unary languages recognized by two-way one-counter machines

  2013cites this paper
• Unary Languages Recognized by Two-Way One-Counter Automata

  2013cites this paper
• Bounded Counter Languages

  2012cites this paper
• Push down automata vs quantum push down automata

  2012cites this paper
• One-way reversible and quantum finite automata with advice

  2012cites this paper
• One-Counter Verifiers for Decidable Languages

  2012cites this paper
• Quantum Counter Automata

  2011influential citation
• Superiority of one-way and realtime quantum machines

  2011cites this paper
• Empowering measures for quantum finite automata (QFA)

  2011cites this paper
• Recent Trend of Development in Quantum Finite Automata

  2011cites this paper
• Quantum computation with write-only memory

  2010cites this paper
• On the Weakness of One-Way Quantum Pushdown Automata

  2010cites this paper
• Automata with Quantum and Classical Resources

  2006cites this paper
• Expressive Power of Quantum Pushdown Automata with Classical Stack Operations under the Perfect-Soundness Condition

  2006cites this paper
• Simulations of Quantum Turing Machines by Quantum Multi-Stack Machines

  2005cites this paper
• Quantum versus Classical Pushdown Automata in Exact Computation

  2005cites this paper
• Exact Quantum Algorithms for the Leader Election Problem

  2005cites this paper
• QUANTUM PUSHDOWN AUTOMATA THAT CAN DETERMINISTICALLY SOLVE A CERTAIN PROBLEM

  2005cites this paper
• Ja n 20 05 Simulations of Quantum Turing Machines by Quantum Multi-Counter Machines

  2005cites this paper
• Quantum automata and quantum computing

  2002cites this paper
• Ju l 2 01 2 One-counter verifiers for decidable languages ∗

  year unknowncites this paper