3
$\begingroup$

First post here, woot. I've been a member of Stack Overflow for a while, so hopefully you guys are just as friendly!

The DFA

I'm having issues converting simple NFAs to DFAs... I just don't get it. Basically, with the one shown here, the most I've come up with is $s_0$ accepting inputs of $1$ from $s_1$ and $s_1$ accepting inputs of $0$ from $s_0$. Is that even remotely correct? FSM's are interesting... but bloody hell, the learning material is a bit difficult to chew.

For those that don't know the acronyms, I'm basically trying to find the deterministic finite-state automaton equivalent of the pictured non-deterministic finite-state machine.

  • 0
    Have you figured out how many states your DFA is going to have?2011-12-14
  • 0
    This question would have been perfect for the upcoming [Computer Science Stack Exchange](http://area51.stackexchange.com/proposals/35636/computer-science-non-programming?referrer=pdx8p7tVWqozXN85c5ibxQ2). So, if you like to have a place for questions like this one, please go ahead and help this proposal to take off!2011-12-15
  • 1
    An algorithm for this task is probably given in any basic TCS textbook. Have you checked one?2011-12-15

2 Answers 2