2 Deterministic Finite Automata, State, transition function, DFA
This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
In this lecture you will learn about
1. Finite automata
2. states
3. alphabets
4. language of deterministic finite automata
5. solved example of DFA
To study interview questions on Linked List watch • Programming Interviews: Linked List
To prepare for programming Interview Questions on Binary Trees
• Programming Interviews: Binary Trees
To study programming Interview questions on Stack, Queues, Arrays visit
• Programming Interviews: Queue, Stack and A...
To watch all Programming Interview Questions visit
• Programming Interviews Questions
To learn about Pointers in C visit
• Pointers in C (All you wanted to know)
To learn C programming from IITian S.Saurabh visit
• C Programming Tutorial