Finite Automata as Quantum Tensor Networks

Finite automata accept a description using linear algebra that we can translate into a system of tensors or quantum circuits. These provide examples of quantum systems only requiring a polynomial amount of information to represent and simulate classicaly.