2000/01/04 by Maris Valdats, Māris Valdats, Valdats, Maris
Computer Science · Physics and Astronomy · #Advanced Algebra and Logic #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph) #quant-ph #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.quant-ph/0001005
13 pages, 9 figures
arxiv created 2000/01/04 · openalex publication_date 2000/01/04 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular languages. In this paper we show, that class of languages recognizable by QFA is not closed under union, even not under any Boolean operation, where both arguments are significant.