RAIRO-Theor. Inf. Appl.
Volume 40, Number 2, April-June 2006Alberto Bertoni: Climbing summits
|Page(s)||315 - 332|
|Published online||20 July 2006|
Quantum finite automata with control language
Dipartimento di Scienze dell'Informazione,
Università degli Studi di Milano,
via Comelico 39, 20135 Milano, Italy;
Bertoni et al. introduced in Lect. Notes Comput. Sci. 2710 (2003) 1–20 a new model of 1-way quantum finite automaton (1qfa) called 1qfa with control language (1qfc). This model, whose recognizing power is exactly the class of regular languages, generalizes main models of 1qfa's proposed in the literature. Here, we investigate some properties of 1qfc's. In particular, we provide algorithms for constructing 1qfc's accepting the inverse homomorphic images and quotients of languages accepted by 1qfc's. Moreover, we give instances of binary regular languages on which 1qfc's are proved to be more succinct (i.e. , to have less states) than the corresponding classical (deterministic) automata.
Mathematics Subject Classification: 68Q10 / 68Q19 / 68Q45
Key words: Quantum computing / quantum finite automata.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.