Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ISAAC
/
Paper
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata.
Takeshi Koshiba
Venue
B
ISAAC
Year
2001
Proceedings
ISAAC
DBLP record
conf/isaac/Koshiba01 ↗
Browse the full
ISAAC paper archive
.