A Turing Machine Is Just a Finite Automaton with Two Stacks (2018)scholarworks.utep.edu3 points·peter_d_sherman··0 commentsOpen articleSaveView on HN