What does this Deterministic finite automaton do?

by nighthound
Tags: automaton, computer science, deterministic, dfa, logic
nighthound is offline
Apr3-12, 01:45 PM
P: 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, ....
Phys.Org News Partner Science news on Phys.org
Cougars' diverse diet helped them survive the Pleistocene mass extinction
Cyber risks can cause disruption on scale of 2008 crisis, study says
Mantis shrimp stronger than airplanes

Register to reply

Related Discussions
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