GRUSKA, Jozef, Daowen QIU, Lvjun LI, Xiangfu ZOU and Paulo MATEUS. Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. Acta Informatica. Springer-Verlag, 2011, vol. 48, 5-6, p. 271-290. ISSN 0001-5903. Available from: https://dx.doi.org/10.1007/s00236-011-0139-6.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
Name in Czech Víceznakové kvantové konečné automaty: rozhodnutelnost ekvivalence a minimalizace stavů
Authors GRUSKA, Jozef (703 Slovakia, guarantor, belonging to the institution), Daowen QIU (156 China), Lvjun LI (156 China), Xiangfu ZOU (156 China) and Paulo MATEUS (620 Portugal).
Edition Acta Informatica, Springer-Verlag, 2011, 0001-5903.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Impact factor Impact factor: 0.444
RIV identification code RIV/00216224:14330/11:00054279
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1007/s00236-011-0139-6
UT WoS 000297512700001
Keywords (in Czech) Kvantové konečné automaty; ekvivalence; minimalizace
Keywords in English Quantum finite automata; rozhodnutelnost; minimalizace
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 20/4/2012 09:17.
Abstract
In this paper, we study the decidability of the equivalence and minimization problems of multi-letter quantum finite automata.
Abstract (in Czech)
Článek zkoumá rozhodnutelnost ekvivalence a problém minimalizace víceznakových kvantových konečných automatů.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 21/5/2024 23:51