DFA DESIGN

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

Solution:

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

Solution: 

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

Solution:

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

Solution:

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

Solution: 

Draw a DFA for the language accepting strings starting with ‘ab’ over input alphabets ∑ = {a, b}

 

Construct a DFA that accepts a language L over input alphabets ∑ = {a, b} such that L is the set of all strings starting with ‘aa’ 

The required DFA is-