>>> Complexity Seminar のお知らせ <<< 

題目：  Polynomial-time algorithms for the equivalence
	for one-way quantum finite automata
発表者：Takeshi Koshiba（小柴 健史）

日時：２００１年１１月２２（木）４時３０分〜
場所：東京工業大学 西８ (W) 号館（１０階）コラボレーションルーム

概要: 
   Two quantum finite automata are equivalent if for any string $x$
   the two automata accept $x$ with equal probability. This paper
   gives a polynomial-time algorithm for determining whether
   two measure-once one-way quantum finite automata are equivalent.
   The paper also gives a polynomial-time algorithm for determining whether
   two measure-many one-way quantum finite automata are equivalent.

以上．