edited by
1,955 views

1 Answer

0 votes
0 votes

yes we can convert into dfa

Related questions

0 votes
0 votes
0 answers
3
admin asked Apr 3, 2019
1,030 views
Consider the following $\in-NFA.$Compute the $\in-$closure of each state.Give all the strings of length three or less accepted by the automaton.Convert the automaton to a...
3 votes
3 votes
0 answers
4
admin asked Apr 3, 2019
1,812 views
Design NFA's to recognize the following sets of strings.$abc,abd,$ and $aacd.$ Assume the alphabet is $\{a,b,c,d\}$$0101,101,$ and $011.$ Assume the alphabet is $\{0,1\}$...