Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Golovkins, Marats"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quantum finite automata and probabilistic reversible automata: R-trivial idempotent languages
Marats Golovkins
,
Maksim Kravtsev
,
Vasilijs Kravcevs
Lecture Notes in Computer Science
6907
, 2011, pp. 351-363
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Marats Golovkins
,
Maksim Kravtsev
,
Vasilijs Kravcevs
Theoretical Computer Science
410
(20), 2009, pp. 1942-1951
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Theory of Computing Systems
39
(1), 2006, pp. 165-188
Varieties generated by certain models of reversible finite automata
Marats Golovkins
,
Jean-Eric Pin
Lecture Notes in Computer Science
4112
, 2006, pp. 83-93
Algebraic results on quantum automata
Andris Ambainis
,
Martin Beaudry
,
Marats Golovkins
,
Arnolds Ķikusts
,
Mark Mercer
,
Denis Thérien
Lecture Notes in Computer Science
2996
, 2004, pp. 93-104
Probabilistic reversible automata and quantum automata
Marats Golovkins
,
Maksim Kravtsev
Lecture Notes in Computer Science
2387
, 2002, pp. 574-583