Quantum finite automata

Known as: Metric automaton, Metric automata, Topological automata

In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Linear temporal logic is a widely used method for verification of model checking and expressing the system specifications. The…

2016

1-way multihead quantum finite state automata (1QFA(k)) can be thought of modified version of 1-way quantum finite state automata…

2015

One-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of…

2009

In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that…

2009

Two quantum finite automata are equivalent if for any string x the two automata accept x with equal probability. This paper gives…

2008

We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded…

2007

We show that for any monoid M, the family of languages accepted by M-automata (or equivalently, generated by regular valence…

2005

1998

We exhibit a family {L_n} of finite regular languages such that any 1-way quantum finite automaton (QFA) accepting L_n with…

1979