Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

What does this Deterministic finite automaton do?

  1. Apr 3, 2012 #1
    1. The problem statement, all variables and given/known data
    Can someone explain the condition that DFA(Deterministic finite automaton) take as an accepting state and rejecting state?

    2. Relevant equations

    3. The attempt at a solution
    I have tried analyzing through it, but it seems pretty random to me.
    It accepts: empty,ab, ba, abab, baba, aabb, bbaa, bbb, aaa, bbaaab, aabbba,....
    Rejects: a, aa, aab, aba, b, baa, bb, bba, bbaaa, ....
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted
Similar Discussions: What does this Deterministic finite automaton do?