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:
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:
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 15: Draw a DFA for the language accepting strings starting with
‘00’ or ’11’ 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 19: Draw a DFA for the language accepting odd or even binary
numbers strings 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:
