0

In introduction to the theory of computation book, for the language formula a state diagram is given as :

enter image description here

I know there could be alternative diagrams but I doubt the solution I found might be wrong which is slightly different than the original one: enter image description here

I would appreciate any counter inputs for my solution.

Nili Miliy
  • 23
  • 5
  • Your transition diagram does not allow for the empty string to be accepted by your PDA, whereas the book's diagram does. The empty string is a member of the target language, so the book's is correct and yours is not. – Welbog Mar 23 '17 at 14:56
  • @Welbog my diagram also allows for empty state since q1 is accept state in my case thus when string is empty which means no input, one branch will stay at q1 and accept the empty string. – Nili Miliy Mar 23 '17 at 18:46
  • Ah, I see that. You're right. I believe they are equivalent. – Welbog Mar 23 '17 at 19:28

1 Answers1

0

Can't bear to see an unanswered question. So Yes they are equivalent with what I have observed.

Ilaya Raja S
  • 415
  • 5
  • 18