>>12381984Why is that OP?
Also semi-unrelated but the theory of automata is actual a really interesting subject with very interest connections to combinatorics, group theory, and dynamical systems. These connections are extremely interesting, elegant, easy to understand, and even applicable to practical problems. Unfortunately, textbooks on the theory of computation choice to focus on the arkane details of various normal form theorems and equivalence between different classes of machines and computational problems. These are certainly important topics, but they are not especially interesting or illuminating.
I think people would get a lot more out of these courses if they also included surveys of concepts like the Lindenmyer L-system or the duality between deterministic automata and these things called k-unary algebras.
https://en.wikipedia.org/wiki/L-system 
