Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Chandan_kumar_111
0
votes
1
NFA-E to DFA conversion. (which is the correct solution?)
1. Which solution is correct? (or both wrong!) 2. Does every 'DFA equivalent' of any NFA has same starting state? if not, please give any smallest example.
1. Which solution is correct? (or both wrong!)2. Does every 'DFA equivalent' of any NFA has same starting state? if not, please give any smallest example.
2.5k
views
answered
Mar 22, 2018
Theory of Computation
theory-of-computation
finite-automata
number-of-states
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register