Jump to content

Is this a DFA?

wholegrain
in Homework Help

Featured Replies

!

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.

 

  • Author

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.

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

Archived

This topic is now archived and is closed to further replies.

Go to topic listing

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications
Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.