0 votes 0 votes closed with the note: Duplicate of : https://gateoverflow.in/90870/me-flt-4-q-51#a90883 Is Turing Machine that accpet Regular Languages Decidable ? Theory of Computation turing-machine theory-of-computation + – PEKKA asked Dec 8, 2016 • closed Dec 8, 2016 by Habibkhan PEKKA 219 views comment Share Follow See all 0 reply Please log in or register to add a comment.