lecture 17: dfa examples with solutions in hindi | EXAM PREPARATION - deterministic finite automata

dfa examples with solutions in hindi urdu lecture consists of so many deterministic finite automata important examples and solutions that are clearly explained to practice for EXAM PREPARATION and easily get grip on deterministic finite automata examples and solutions. this lecture of dfa examples with solutions in urdu (i.e. dfa automata in hindi urdu ) is 17th lecture of my series theory of automata in urdu ( i.e. , theory of computation in hindi or theory of computer science tutorials in urdu or automata theory lectures in urdu ) toc dfa automata in urdu is explained with so many important examples and solutions, so if you are looking for dfa in urdu or dfa in hind then is the best video for you following are the examples that are explained in this tutorial of dfa 1. Draw fa that accept exactly a 2. Draw fa that accepts all words starting with a 3. Draw fa that accepts exactly a or b 4. Draw fa for the language that have b as a second letter over ∑ = { a , b } 5. Draw fa for the language that have exactly 4 ones in every string over ∑ = { 0 , 1 } 6. Draw fa for the language that only accept L = {01, 011 , 100} over ∑ = { 0 , 1 } 7. Draw fa for the language L = { w.na = 1 w ε (a,b)* } 8. L = { w ∈ {0, 1}* | w contains 00 as a substring } 9. Draw fa that accept all strings with double aa in somewhere over ∑ = {a, b} 10. Draw fa that contains exactly baa 11. Draw fa that accept exactly baa and ab 12. Draw fa starting with a and contains any number of b’s in end 13. Draw fa accept all words ending with a 15. Draw fa that accept all words starting and ending with a over ∑= {a , b} 16. Construct an FA which recognizes the set of all strings defined over S = {x, y} starting with the prefix ‘xy’. 17. Draw fa that accept all strings with even length over ∑ = { a , b } 18. Draw fa that accept all strings with even no of b’s over ∑ = { a , b } 19. Draw fa that accept all strings with odd no of 1’s over ∑ = { 0 , 1 } 20. Draw fa that accept all words ending with ab over ∑ = { a , b } regular expression and dfa both are explained for above 20 examples to make you understand the full concept of dfa deterministic finite automata examples with solution pdf and block diagram of finite automata (i.e. dfa transition diagram in automata in urdu hindi) by: Ali Hassan Soomro Facebook: www.facebook.com/AliiHassanSoomro Gmail: alisoomro666@gmail.com