Question

apply martin method to creat FA that does not end at ab and ba only

Answer 1

I did FA last semester (second year Computer Theory) but have not come across Martin's method and a Google search didn't bring up anything helpful either. I suggest checking Martin's method in your textbook's glossary.

@pretypri asked the same question. Maybe you 2 can work together to find a solution?

Answer 2

Here is what I found out about the Martin method after some Googling:
How to avoid dead states in FA using the Martin method:
- Make each state label, as it progresses, based on the input strings.
- Based on the conditions of the Regular expressions or FA, only required states are marked final.
- Not every FA can be modeled in this way!