Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata.
Andris Ambainis
,
Arnolds Kikusts
,
Maris Valdats
Venue
A
STACS
Year
2001
Proceedings
STACS
DBLP record
conf/stacs/AmbainisKV01 ↗
Browse the full
STACS paper archive
.