What is a DFA(Deterministic Finite Automata)?

[bennycs]

Just wondering what exactly does it do and how do i get started? I have to write this program for class, i'm not looking for anyone to do it, just to give me some advice on how to approach the problem. The instructor was real vague and the book is not much help. Thanks for any advice.

[Roy Sinclair]

Try: http://www.devincook.com/goldparser/concepts/about-dfa.htm

[premshree]

Well, I don't know what program you want to write...but I can tell you 'bout DFA. DFA is a finite automata (FA). FA is the mathematical model of a Finite State Machine (FSM). Now, in case of DFA, unlike NFA (Non-deterministic Finite Automata), one symbol can change the state to exactly one another state; i.e the same symbol cannot change the current state to two different states.

For example, if a symbol '1' changes the state 'q0' to 'q1', then '1' should not be able to change state 'q0' to say, 'q2'; i.e there is no ambiguity involved in case of DFA.

It is not possible to comprehend everything about automata and stuff in such a small para..., I suggest you refer Introduction to Automata and Language Theory, [R Motwani, J.E. Hopcroft and J.D. Ullman], Addison-Wesley. Here's the link: http://www.awlonline.com/product/0,2627,0201441241,00.html