in Theory of Computation retagged by
114 views
0 votes
0 votes
What is the Finite Automata( NFA, epsilon-NFA or DFA) for the regular expression (a*ba)* ?
in Theory of Computation retagged by
by
114 views

1 Answer

0 votes
0 votes

Idea:  To create (a*ba)* we need a self loop of the form “a*ba” which can be created using the following NFA. 

2 Comments

I have tried somewhat like this using €-NFA. Is it correct ? 

0
0
Yes it is correct.
0
0

Related questions