Scribd
Upload
651 views4 pages

2) Give The Language of The Following DFA: TAFL CIA 1 Solution (2019-20)

This document contains 10 questions related to finite automata theory. The questions cover topics such as: 1) Finding substrings in a string using a DFA. 2) Describing the language of a given DFA. 3) Differentiating between DFAs and NFAs. 4) Using an extended transition function to determine the result of an input string on a finite automaton. The document provides solutions to constructing DFAs for various languages over different alphabets. It also includes questions on minimizing DFAs, converting NFAs to DFAs, and designing epsilon-NFAs.

Uploaded by

vik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
651 views4 pages

2) Give The Language of The Following DFA: TAFL CIA 1 Solution (2019-20)

This document contains 10 questions related to finite automata theory. The questions cover topics such as: 1) Finding substrings in a string using a DFA. 2) Describing the language of a given DFA. 3) Differentiating between DFAs and NFAs. 4) Using an extended transition function to determine the result of an input string on a finite automaton. The document provides solutions to constructing DFAs for various languages over different alphabets. It also includes questions on minimizing DFAs, converting NFAs to DFAs, and designing epsilon-NFAs.

Uploaded by

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

TAFL CIA 1 Solution (2019-20)

1) How many substrings aab are in wwRw, where w = aabbab ?


Since wwRw = aabbabbabbaaaabbab, (1/2 mark) there are only two substrings of aab. (1/2
mark)

2) Give the language of the following DFA


a b

→p* q r
q r p
r r r
L= {(ab)n | n>=0}
(1/2 mark for construction of graph or any other justification, ½ mark for correct result)
3) Differentiate between DFA and NFA (1/2 mark per difference0
4) Use extended transition function to show the result of giving string w = 0011 as input to
the following finite automata

{q0,q1,q2} (1/2 mark for computation, ½ mark for correct result)


5) State the Myhill Nerode Theorem. What are its applications?
½ mark for statement. ½ mark for applications
6) Construct a DFA to accept set of strings on {0,1} in which, every substring of 3 symbols
has at most two zeros. (All strings of length <=2 are also in the language)

(5 marks for fully correct solution. Partial marks for partially correct solution)
TAFL CIA 1 Solution (2019-20)

7) Construct DFA equivalent to the following εNFA

(5 marks for fully correct solution. Partial marks for partially correct solution)
8) Minimize the following DFA
a b

→q1(Final) q3 q2
q2 q4 q1

q3 q5 q4
q4 q4 q4

q5 (Final) q3 q2

a b

→[q1q5] (Final) q3 q2
q2 q4 [q1q5]

q3 [q1q5] q4
q4 q4 q4

(5 marks for fully correct solution. Partial marks for partially correct solution)

9) Design a DFA for accepting binary numbers whose decimal equivalent is divisible by 5
TAFL CIA 1 Solution (2019-20)

(5 marks for fully correct solution. Partial marks for partially correct solution)
10 a) Give a DFA for the following language over the alphabet Σ = {0, 1}:
L={ w | w starts with 1 and has odd length, or starts with 0 and has even length }
E.g., strings 1101011, 000101 are in L, while 1011 and 00001 are not in L.

(5 marks for fully correct solution. Partial marks for partially correct solution)
10 b) Convert the following NFA into a DFA
0 1
→q0 q0, q1 q0, q3
q1 q2 -
q2 (Final) - -
q3 - q4
q4 (Final) - -

(5 marks for fully correct solution. Partial marks for partially correct solution)
11 a) Design ε −NFA for the language of strings consisting of either 01 repeated one or more times,
or 010 repeated one or more times over alphabets Σ = {0, 1}.
TAFL CIA 1 Solution (2019-20)

(5 marks for fully correct solution. Partial marks for partially correct solution)
(b)

You might also like