How does the Turing machine?
Please could someone explain with an example. Like this:
Develop a turing machine that accepts the language
1) L1 = {W E {a,b}^* / the third symbol of W is "a"}
No replies to this topic
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users


Sign In
Create Account


Back to top









