DFA solved examples

DFA solved examples

Example 1: Draw a DFA for the language accepting strings ending with ‘0’ over input alphabets ∑={0, 1} ? 

Solution:




Example 2: Draw a DFA for the language accepting strings ending with ‘01’ over input alphabets ∑={0, 1} ?

Solution: 



Video lecture DFA ending with ab

Example 3: Draw a DFA for the language accepting strings ending with ‘00’ over input alphabets ∑={0, 1} ?  

Solution:



Example 4: Draw a DFA for the language accepting strings ending with ‘011’ over input alphabets ∑ = {0, 1} ?

Solution: 


Example 5: Draw a DFA for the language accepting strings ending with ‘0110’ over input alphabets ∑ = {0, 1} ?

Solution:

Example 6: Draw a DFA for the language accepting strings ending with ‘0011’ over input alphabets ∑ = {0, 1} ?

Solution:

Example 7: Draw a DFA for the language accepting strings with ‘0’ only over input alphabets ∑={0, 1} ?  

Solution:

Dead State in DFA

Example 8: Draw a DFA for the language accepting strings with ‘0’ and '1' only over input alphabets ∑={0, 1} ?

Solution:

Example 9: Draw a DFA for the language accepting strings starting with ‘0’ over input alphabets ∑={0, 1} ?  

Solution:

Video lecture on DFA starting with 'a'


Example 10: Draw a DFA for the language accepting strings starting with ‘01’ over input alphabets ∑={0, 1} ?

Solution:

Example 11: Draw a DFA for the language accepting strings starting with ‘00’ over input alphabets ∑={0, 1} ?  

Solution:

Example 12: Draw a DFA for the language accepting strings starting with ‘011’ over input alphabets ∑ = {0, 1} ?

Solution:

Example 13: Draw a DFA for the language accepting strings starting with ‘0110’ over input alphabets ∑ = {0, 1} ?

Solution: 

Example 14: Draw a DFA for the language accepting strings starting with ‘0011’ over input alphabets ∑ = {0, 1} ?

Solution: 

Example 15: Draw a DFA for the language accepting strings starting with ‘00’ or '11' over input alphabets ∑ = {0, 1} ?

Solution: 


Video lecture on DFA starting with 'aa' or 'bb'


Example 16: Draw a DFA for the language accepting strings without substring ‘00’ over input alphabets ∑ = {0, 1} ?

Solution:

Example 17: Draw a DFA for the language accepting even binary numbers strings over input alphabets ∑ = {0, 1} ?

Soluntion: 

Example 18: Draw a DFA for the language accepting odd binary numbers strings over input alphabets ∑ = {0, 1} ?

Solution: 

Example 19: Draw a DFA for the language accepting odd or even binary numbers strings over input alphabets ∑ = {0, 1} ?

Solution:

Example 20: Draw a DFA for the language accepting strings containg even number of total zeros over input alphabets ∑ = {0, 1} ?

Solution: 

Example 21: Draw a DFA for the language accepting strings starting and ending with different characters over input alphabets ∑ = {0, 1} ?

Soluiton:

Example 22: Draw a DFA for the language accepting strings starting and ending with same character over input alphabets ∑ = {0, 1} ?

Solution: 


Example 23: Draw a DFA for the language accepting strings starting and ending with '0' always over input alphabets ∑ = {0, 1} ?

Solution: 


Example 24: Draw a DFA for the language accepting strings containing three consecutives '0' always over input alphabets ∑ = {0, 1} ?

Solution: 

Example 25: Draw a DFA for the language accepting strings such that each '0' is immediately preceded and followed by '1' over input alphabets ∑ = {0, 1} ?

Solution: 


Example 26: Draw a DFA for the language accepting strings containing at most two '0' over input alphabets ∑ = {0, 1} ?

Solution: 

Example 27: Draw a DFA for the language accepting strings containing at least two '0' over input alphabets ∑ = {0, 1} ?

Solution: 

Example 28: Draw a DFA for the language accepting strings containing exactly two '0' over input alphabets ∑ = {0, 1} ?

Solution: 

Example 29: Draw a DFA for the language accepting strings with '011' as substring over input alphabets ∑ = {0, 1} ?

Solution: 

Example 30: Draw a DFA for the language accepting strings ending in either '01', or '10' over input alphabets ∑ = {0, 1} ?

Solution: 

Example 31: Draw a DFA for the language accepting strings containing '01', or '10' as substring over input alphabets ∑ = {0, 1} ?

Solution: 

Example 32: Draw DFA that accepts any string which ends with 1 or it ends with an even number of 0's following the last 1. Alphabets are  {0,1}.

Solution: 

Example 33: Construct DFA accepting set of all strings containing even no. of 1's and even no. of 0's over input alphabet {1,0}.

Solution: 

Example 34: Give DFA accepting the language over alphabet {0,1} such that all strings of 0 and 1 ending in 101.

Solution: 

Example 35: Construct DFA for anb | n>=0.

Solution: 

Example 36: construct DFA for binary integer divisible by 3 ?

Solution: 
Example 37: Draw a DFA for the language accepting strings containing neither '00', nor '11' as substring over input alphabets ∑ = {0, 1} ?

Solution: 


Python Programming ↓ 👆
Java Programming ↓ 👆
JAVA EasyExamNotes.com covered following topics in these notes.
JAVA Programs
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

Practicals:
Previous years solved papers:
A list of Video lectures References:
  1. Sebesta,”Concept of programming Language”, Pearson Edu 
  2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
  3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
  4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

    Computer Organization and Architecture ↓ 👆

    Computer Organization and Architecture 

    EasyExamNotes.com covered following topics in these notes.

    1. Structure of desktop computers
    2. Logic gates
    3. Register organization
    4. Bus structure
    5. Addressing modes
    6. Register transfer language
    7. Direct mapping numericals
    8. Register in Assembly Language Programming
    9. Arrays in Assembly Language Programming

    References:

    1. William stalling ,“Computer Architecture and Organization” PHI
    2. Morris Mano , “Computer System Organization ”PHI

    Computer Network ↓ 👆
    Computer Network

    EasyExamNotes.com covered following topics in these notes.
    1. Data Link Layer
    2. Framing
    3. Byte count framing method
    4. Flag bytes with byte stuffing framing method
    5. Flag bits with bit stuffing framing method
    6. Physical layer coding violations framing method
    7. Error control in data link layer
    8. Stop and Wait scheme
    9. Sliding Window Protocol
    10. One bit sliding window protocol
    11. A protocol Using Go-Back-N
    12. Selective repeat protocol
    13. Application layer
    References:
    1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
    2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
    3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
    4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.