I am a trying to prove that every regular language is decidable.
So in order to prove that I am trying to show that I can move from deterministic finite automaton (DFA) to a Turing decidable machine.
So I am not sure how to construct a Turing machine that simulates the original automate (DFA).
The states (in the automate and the Turing machine ) will be similar off course.. but I am not sure how to continue..
Thanks in advance. Shiran