in Theory of Computation
827 views
0 votes
0 votes

in Theory of Computation
827 views

1 Answer

2 votes
2 votes

If you carefully look at the given $\epsilon$- NFA it is accepting  $x^{*}$ and $\epsilon$ and $y^{*}$ i.e.$x^{n}y^{m}$ where n>=0 and m>=0 but not $y^{m}x^{n}$.

So its NFA will be

Now we can convert this NFA by defining transition for each state. For state A transition for x and y are defined but for B state transition for x is not defined so we have to add a dead state.

hence the DFA will be

2 Comments

Thank you for the answer!. Just wanted to ask how did you make those automata on which application?
0
0
0
0

Related questions

0 votes
0 votes
1 answer
2