Geodesic
Succinctness of two-way probabilistic and quantum finite automata
Discrete mathematics & theoretical computer science, Tome 12 (2010) no. 4.

Voir la notice de l'article provenant de la source Episciences

special issue dedicated to the second edition of the conference AutoMathA: from Mathematics to Applications 
@article{DMTCS_2010_12_4_a2,
     author = {Yakaryilmaz, Abuzer and Say, A. C. Cem},
     title = {Succinctness of two-way probabilistic and quantum finite automata},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {12},
     number = {4},
     year = {2010},
     doi = {10.46298/dmtcs.509},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.509/}
}
TY  - JOUR
AU  - Yakaryilmaz, Abuzer
AU  - Say, A. C. Cem
TI  - Succinctness of two-way probabilistic and quantum finite automata
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - 12
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.509/
DO  - 10.46298/dmtcs.509
LA  - en
ID  - DMTCS_2010_12_4_a2
ER  - 
%0 Journal Article
%A Yakaryilmaz, Abuzer
%A Say, A. C. Cem
%T Succinctness of two-way probabilistic and quantum finite automata
%J Discrete mathematics & theoretical computer science
%D 2010
%V 12
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.509/
%R 10.46298/dmtcs.509
%G en
%F DMTCS_2010_12_4_a2
Yakaryilmaz, Abuzer; Say, A. C. Cem. Succinctness of two-way probabilistic and quantum finite automata. Discrete mathematics & theoretical computer science, Tome 12 (2010) no. 4. doi : 10.46298/dmtcs.509. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.509/

Cité par Sources :