International Colloquium on Words, Languages and Combinatorics
QUANTUM FINITE AUTOMATA
Jozef Gruska, Roland Vollmar
Abstract
Various quantum versions of the most basic models of the classical finite automata have already been introduced and various modes of their computations have already started to be investigated. In this paper we overview basic models, approaches, techniques and results in this promising area of quantum automata that is expected to play an important role also in theoretical computer science. We also summarize some open problems and research directions to pursue in this area.