On the class of languages recognizable by 1-way quantum finite automata
Quantum Physics
2007-05-23 v1
Abstract
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Keywords
Cite
@article{arxiv.quant-ph/0009004,
title = {On the class of languages recognizable by 1-way quantum finite automata},
author = {Andris Ambainis and Arnolds Kikusts and Maris Valdats},
journal= {arXiv preprint arXiv:quant-ph/0009004},
year = {2007}
}
Comments
18 pages, 16 figures, extends quant-ph/0001005