2001 | OriginalPaper | Buchkapitel
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
verfasst von : Andris Ambainis1, Arnolds KĶikusts, Māris Valdats
Erschienen in: STACS 2001
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some neces- sary and some sufficient conditions for a (regular) language to be recog- nizable 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.