The class of languages recognizable by 1-way quantum finite automata is not closed under union

Simple item page
dc.creatorValdats, Maris
dc.date2000-01-04
dc.date.accessioned2026-07-07T05:59:27Z
dc.date.available2026-07-07T05:59:27Z
dc.descriptionIn 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.
dc.description13 pages, 9 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0001005
dc.identifierhttp://arxiv.org/abs/quant-ph/0001005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88687
dc.subjectQuantum Physics
dc.titleThe class of languages recognizable by 1-way quantum finite automata is not closed under union
dc.typetext

Files

Collections

arXiv