I am trying to solve a practice problem from my textbook which is to draw an FA from this language: L(ab* a*) U L((ab)*ba)I need help to draw the second part L((ab)*ba). I know the shortest string is ba, then it is abba, ababba, abababba, etc.I started off with this to show the shortest string:However, now I need to add the (ab)* part in the front of this which I am unsure how to approach this.Any help would be great, and sorry if this seems obvious to some of you... I just don't see it right now!EDIT: If it were (a*)ba I know how I would approach it, but the (ab)* is confusing me.
Convert regular expression to FA?
regular languages;finite automata;regular expressions