Apr3-12, 02:45 PM
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, ....
|Register to reply|
|Reversing a regular deterministic finite automata||Set Theory, Logic, Probability, Statistics||2|
|Deterministic Finite State Automaton Construction||Engineering, Comp Sci, & Technology Homework||1|
|deterministic finite automata||Engineering, Comp Sci, & Technology Homework||1|
|Buchi automaton||Engineering, Comp Sci, & Technology Homework||2|
|Hard Pushdown Automaton||Engineering, Comp Sci, & Technology Homework||0|