1
votes

I am having some troubles with a exercise that asks to draw a Turing Machine which decides a language L2 = {w ∈ {0,1}∗|w contains an even number of 1’s }.

Does anybody have a solution to compare with what I have?

Thanks

1
Show us what you've done, and someone might help you with that. - Andrew Shepherd

1 Answers

0
votes

You can design a turing machine that closely resembles this: enter image description here