Build a PM that takes any input from the language defined by (a + b)* and deletes

Question:

Build a PM that takes any input from the language defined by (a + b)* and deletes all substrings of the form aaa, leaving all else in the word intact.

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: