Question

Construct a TG for the language of all strings where characters in odd numbered positions (i.e., the 1^st, 3^rd, 5^th, etc. characters) must be the letter "a". convert your TG from problem 3 into a regular expression (show the steps that you take).

Theory of computation.

Please show all work.

Answer 1

3)

x can be any input

Now all strings having odd character as 'a' will only satisfy this turing machine and empty string also satisfied since first state acceptable final state.

4)

Regular expression will be a*x* | {x can be any character except 'a'}

since above turing machine is accepting empty string, so regular expression will be a*x* , a* means it accepts empty or more than one instance of 'a'