In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process. They provide a mathematical abstraction of real-world quantum computers. Several types of automata may be defined, including measure-once and measure-many automata. Quantum finite automata can also be understood as the quantization of subshifts of finite type, or as a quantization of Markov chains. QFAs are, in turn, special cases of geometric finite automata or topological finite automata. The automata work by receiving a finite-length string [math]\displaystyle{ \sigma=(\sigma_0,\sigma_1,\cdots,\sigma_k) }[/math] of letters [math]\displaystyle{ \sigma_i }[/math] from a finite alphabet [math]\displaystyle{ \Sigma }[/math], and assigning to each such string a probability [math]\displaystyle{ \operatorname{Pr}(\sigma) }[/math] indicating the probability of the automaton being in an accept state; that is, indicating whether the automaton accepted or rejected the string. The languages accepted by QFAs are not the regular languages of deterministic finite automata, nor are they the stochastic languages of probabilistic finite automata. Study of these quantum languages remains an active area of research.