Scribd
Upload
87 views4 pages

TAFL Tutorial Sheet-1

The document provides a tutorial sheet with questions on finite automata theory including designing DFAs and NFAs for various languages, converting NFA to DFA, constructing minimum state automata, and designing Mealy and Moore machines. It contains multiple parts with numerous subquestions on these topics.

Uploaded by

assharma2425
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
87 views4 pages

TAFL Tutorial Sheet-1

The document provides a tutorial sheet with questions on finite automata theory including designing DFAs and NFAs for various languages, converting NFA to DFA, constructing minimum state automata, and designing Mealy and Moore machines. It contains multiple parts with numerous subquestions on these topics.

Uploaded by

assharma2425
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/ 4

Raj Kumar Goel Institute of Technology, Ghaziabad

Department of Computer Science & Engineering


TAFL BCS 402 (2023-24)

Tutorial Sheet-1

Unit-1
Q1. Attempt all.
a. Define Alphabet, String and language.
b. State few applications of automata theory.
c. What do you mean by ε-Closure in FA?
d. Explain the difference between with suitable example:
a. DFA and NFA
b. Mealy and Moore Machine
c. L* and L+
e. Check with the comparison method for testing equivalence of two FA given
below.

PART-1 Questions on Designing of Finite Automata


a. Design an DFA that accepts the binary number whose equivalent is divisible by 5.
b. Construct a DFA for ternary number divisible by 4.
c. Design a FA for ternary Number divisible by 5.
d. Design the DFA that accepts an even number of a’s and even number of b’s.
e. Design a NFA that accepts all strings containing the substring abba , for ∑={a,b}.
f. Design a FA to accept the strings that always end with 101.
g. Construct a DFA for ∑={0,1}.
(i) language containing all binary strings, where each string contains 000 as substring.
(ii) language containing all binary strings, where each string not contain 000.
h. For Σ= {a,b}, Construct dfa's that accept the sets consisting of
(i) all strings with exactly one a
(ii) all strings with at least one a
(iii) all strings with no more than three a's
(iv) all strings with at least one a and exactly two b’s,
(v) all the strings with exactly two a’s and more than two b’s.
(vi) All strings of length at most five.
(vii) The set of all strings ending in aa.
(viii) The set of all strings with three consecutive a’s.
i. Design a Finite Automata for the following:
1. Language contain all strings of a's and b's over the alphabet ∑= (a, b), where every string is
starting with a.
2. Language contain all strings of a's and b's with an input alphabet of 'a' and 'b', where every
string is ending with b.
3. Language contain all strings of a's and b's with an input alphabet of 'a' and 'b', where each
string contain substring 'ab".
4. Language contain all strings of a's and b's with an input alphabet of 's' and 'b', where each
string starts with aa or bb.
5. Language contain all strings of a's and b's with an input alphabet of 'a' and 'b', where each
string starts with ab and ends with ab. (Excluding the string ab)
6. Language contain all binary strings, where each string contains 000, as a substring.
7. Language contain all binary strings, where each string not contains 000.
8. Language contain all binary strings, where the decimal value of each string is divisible by 3.
9. Language contain all strings of a's and b's with an input alphabet of 'a' and 'b', each string
contain second symbol from the beginning is 'a'.

Part2 . Conversion questions on NFA to DFA

a. Convert to a DFA to the equivalent NFA.

Conversion of NFA-ε to DFA

b. Compute the epsilon- closure for the given NFA. Convert it into DFA.
Part-3 Construction of Minimum State Automatation
a. Construct a minimum state automata equivalent to a DFA:

q3 and q4 are final state (3a-2)


(3a-1)

b. Construct a Minimum state DFA from given Finite Automata.

c.
Part-4 Mealy and Moore Machine
a. Design a mealy machine that scans sequence of inputs of 0 and 1 and generates output
“ A” if input strings terminate in “00”, output B if string terminates in ”11”, and
output “C” otherwise. Also convert Mealy machine to Moore machine.

b. Construct a Moore machine equivalent to the Mealy machine.

Fig. 4(a)

Fig. 4(b)

You might also like