Converting the following NFA to Regular Expression.
Quick question:
Do I have to add a new initial state as Q1 is accepting an incoming edge with 0+1 from itself?
Method used:
State elimination method
Asked
Active
Viewed 28 times
0
-
I don't think so – NubPro Apr 02 '18 at 10:04
-
1I don't understand your question. You say "as Q1 is accepting" but isn't Q3 the only accepting state? In any case, you're asking how to convert an automaton to a regular expression and we already have a complete tutorial on that. – David Richerby Apr 02 '18 at 11:38