Quantum Finite Automata

Quantum finite automata are a quantum analog of probabilistic automata or a Markov resolution procedure. They are connected to quantum computers in a related fashion as fixed automata are related to Turing machines. Numerous types of automata could be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of sub shifts of finite kind.