in Theory of Computation retagged by
224 views
0 votes
0 votes

in Theory of Computation retagged by
by
224 views

1 comment

There is no final state in the above epsilon-NFA so just take only one non-final state with self loop on 0,1 and 2.

So it will accept empty language.
0
0

1 Answer

0 votes
0 votes
There is no final state in language so it will accept phi so just make one starting state

Related questions