We have regular expression for DFA and NFA, at the same time, we have CFG for PDAs, What do we have for Turing Machine? If this questions is too obvious, please points me some reading, I am just learning Introduction to the theory of computation_third edition - Michael Sipser myself.
Asked
Active
Viewed 31 times
1
-
We have unrestricted grammars, which describe r.e. languages. See also this question. – Yuval Filmus May 20 '18 at 21:48
-
Can you explain the relationship between title and body of your question? Are there two different questions in there? – reinierpost May 21 '18 at 09:18