Multi-letter quantum finite automata: decidability of the equivalence and minimization of states

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

GRUSKA Jozef QIU Daowen LI Lvjun ZOU Xiangfu MATEUS Paulo

Year of publication 2011
Type Article in Periodical
Magazine / Source Acta Informatica
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/s00236-011-0139-6
Field Informatics
Keywords Quantum finite automata; rozhodnutelnost; minimalizace
Description In this paper, we study the decidability of the equivalence and minimization problems of multi-letter quantum finite automata.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.