wholegrain Posted February 19, 2014 Share Posted February 19, 2014 Link to comment Share on other sites More sharing options...
imatfaal Posted February 20, 2014 Share Posted February 20, 2014 ! Moderator Note Homework Help Rules A simple reminder to all: this is the "Homework Help" forum, not the "Homework Answers" forum. We will not do your work for you, only point you in the right direction. Posts that do give the answers may be removed. So Wholegrain would you explain where you have got to in solving this problem and what has stopped your progress - hopefully members can then help you to overcome your difficulties yourself. Link to comment Share on other sites More sharing options...
wholegrain Posted February 20, 2014 Author Share Posted February 20, 2014 I was just wondering if a DFA can have a transition function that can take one of two input character and if it could have a dead end and if a state can loop on itself. Link to comment Share on other sites More sharing options...
mooeypoo Posted February 21, 2014 Share Posted February 21, 2014 Well, wholegrain, let's consider this by looking over the definition of DFAs and the difference between DFA and NFAs. For instance, this seems to lay them out pretty well: http://theoryofcomputations.blogspot.com/2011/02/difference-between-dfa-and-nfa.html So, considering what DFA *must* have and what it *can't* have, can you answer your own question? This seems like a good resource too http://www.csee.umbc.edu/~squire/cs451_l4.html Link to comment Share on other sites More sharing options...
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now