Takeshi Koshiba. Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. In Peter Eades, Tadao Takaoka, editors, Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings. Volume 2223 of Lecture Notes in Computer Science, pages 268-278, Springer, 2001. [doi]
@inproceedings{Koshiba01,
title = {Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata},
author = {Takeshi Koshiba},
year = {2001},
url = {http://link.springer.de/link/service/series/0558/bibs/2223/22230268.htm},
researchr = {https://researchr.org/publication/Koshiba01},
cites = {0},
citedby = {0},
pages = {268-278},
booktitle = {Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
editor = {Peter Eades and Tadao Takaoka},
volume = {2223},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-42985-9},
}