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
Recent activity by Chandan_kumar_111
2
answers
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
+
–
1
answer
2
Self doubt
Is dead state necessary in minimal DFA?
Is dead state necessary in minimal DFA?
768
views
commented
Mar 22, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
3
Finite Automata : DFA
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??
Is the following DFA valid ?? Can we go to same state from a same state with different inputs ??
532
views
commented
Mar 22, 2018
Theory of Computation
finite-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register