Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
Formal Languages and Automata Theory
2011-09-07 v1 Quantum Physics
Abstract
We study the recognition of R-trivial idempotent (R1) languages by various models of "decide-and-halt" quantum finite automata (QFA) and probabilistic reversible automata (DH-PRA). We introduce bistochastic QFA (MM-BQFA), a model which generalizes both Nayak's enhanced QFA and DH-PRA. We apply tools from algebraic automata theory and systems of linear inequalities to give a complete characterization of R1 languages recognized by all these models. We also find that "forbidden constructions" known so far do not include all of the languages that cannot be recognized by measure-many QFA.
Keywords
Cite
@article{arxiv.1106.2530,
title = {Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages},
author = {Marats Golovkins and Maksim Kravtsev and Vasilijs Kravcevs},
journal= {arXiv preprint arXiv:1106.2530},
year = {2011}
}
Comments
30 pages, 3 figures