2011
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
GRUSKA, Jozef; Daowen QIU; Lvjun LI; Xiangfu ZOU; Paulo MATEUS et. al.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
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
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: 20/4/2012 09:17, RNDr. Pavel Šmerk, Ph.D.
In the original language
In this paper, we study the decidability of the equivalence and minimization problems of multi-letter quantum finite automata.
In Czech
Článek zkoumá rozhodnutelnost ekvivalence a problém minimalizace víceznakových kvantových konečných automatů.
Links
| MSM0021622419, plan (intention) |
|