Scribd
Upload
22 views1 page

DFA Questions

The document outlines a series of deterministic finite automata (DFA) for various languages defined over the binary alphabet Σ = {0,1}. Each language has specific characteristics, such as even length, specific substrings, or constraints on the number of 0's and 1's. The document serves as a guide for constructing DFAs that recognize these defined languages.

Uploaded by

dronasgautam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
22 views1 page

DFA Questions

The document outlines a series of deterministic finite automata (DFA) for various languages defined over the binary alphabet Σ = {0,1}. Each language has specific characteristics, such as even length, specific substrings, or constraints on the number of 0's and 1's. The document serves as a guide for constructing DFAs that recognize these defined languages.

Uploaded by

dronasgautam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Give the DFA for the following languages defined over Σ= {0,1}

a. The set of all strings having even length


b. The set of all strings terminating with ‘1’
c. The set of all strings having ‘01’ as substring
d. The set of all strings having three consecutive 0`s.
e. The set of all strings having even number of 1`s and each 1 is followed by at least one 0.
f. The set of all strings having the 3rd position ‘1’ from the end.
g. The set of all strings having even length and odd number of 0`s.
h. The set of all strings having exactly two 0`s and at least two 1`s.
i. The set of all strings having length multiple of 4.
j. The set of all strings having odd number of 0`s and ending with 1.
k. The set of all strings having 1 at every odd position.
l. The set of all strings beginning with 1 and ending with 0
m. The set of all strings having at least three 1`s.
n. The set of all strings other than the strings 11 and 111.
o. The set of all strings that does not contain the substring 110.
p. The set of all strings that starts with 0 and has odd length, or starts with 1 and has even
length.

You might also like