>>12204150Turing Computability - which is why I said it would go through results related to Turing machines but not really automata. In fairness, I don't think introductory automata is difficult enough to really warrant its own book. You should just do MIT / Stanford course in compilers / language theory and self study results in regular languages up to Myhill-Nerode to get a sense of basic automata, then move onto Turing machines.
The only salient point here is realizing how specific modifications of a an FSA lead to a CFG, and then giving that arbitrary memory access gets a Turing machine. That, and you might want to relate these structures back to semigroups and free monoids at some point.
