12 Deterministic Finite Automata(DFA): No two consecutive 0 or 1
This video lecture is produced by S. Saurabh. He is B.Tech from IIT and MS from USA.
Design a Deterministic Finite Automata for string which contains neither two consecutive 0's or two consecutive 1's
L={ 010101010, 1010101, 01,10,1010,0101,...}
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 ...
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