Refer to the following PM:

(i) Show that if an input has exactly one more a than b, it will crash on this PM in state READ₁.
(ii) Show that if an input string has exactly one more b than a , it will crash on this PM in state READ₃.
(iii) Show that if an input string has more than one more a than b or more than one more b than a, then it will loop forever on this PM.

Transcribed Image Text:

READ₁ ADD a a START READ₂ b READ3 b ADD b ACCEPT a