Scribd
Upload
59 views4 pages

Atcd QB

The document contains 14 questions about finite state machines and formal languages including defining deterministic and non-deterministic finite state machines, providing examples of languages and finite state machines, and operations on formal languages and minimizing finite state machines.

Uploaded by

addicted youtuber
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
59 views4 pages

Atcd QB

The document contains 14 questions about finite state machines and formal languages including defining deterministic and non-deterministic finite state machines, providing examples of languages and finite state machines, and operations on formal languages and minimizing finite state machines.

Uploaded by

addicted youtuber
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

Module I – Question Bank

1. Define Deterministic finite state machine and Non-Deterministic Finite


State Machine. Mention their difference.
2. Write at least 10 Applications of “Theory of Computation”.
3. Give a clear English description of the language accepted by the following
FSM:

4. Build a deterministic FSM for each of the following languages:


A. {w ∈ {a, b}* : every a in w is immediately preceded and followed by b}.
B. {w ∈ {a, b}* : w does not end in ba}
C. {w ∈ {0, 1}* : w corresponds to the binary encoding, without leading 0’s, of
natural numbers that are evenly divisible by 4}.
D. {w ∈ {0, 1}* : w corresponds to the binary encoding, without leading 0’s, of
natural numbers that are powers of 4}.
E. {w ∈ {0-9}* : w corresponds to the decimal encoding, without leading 0’s, of
an odd natural number}.
F. {w ∈ {0, 1}* : w has 001 as a substring}.
G. {w ∈ {0, 1}* : w does not have 001 as a substring}.
H. {w ∈ {a, b}* : w has bbab as a substring}.
I. {w ∈ {a, b}* : w has neither ab nor bb as a substring}.
J. {w ∈ {a, b}* : w has both aa and bb as a substrings}.
K. {w ∈ {a, b}* : w contains at least two b’s that are not immediately followed by
a’s}.
L. The set of binary strings with at most one pair of consecutive 0’s and at most
one pair of consecutive 1’s.
M. {w ∈ {0, 1}* : none of the prefixes of w ends in 0}.
N. {w∈ {a, b}*: (#a(w) + 2⋅#b(w)) ≡5 0}. (#aw is the number of a’s in w).
O. If M is a DFSM and ε ∈ L(M), what simple property must be true of M?

5. Given the following languages


L1={w ∈ anbn : n>0 }
L2={w ∈ ambmcp : m,p>0 }
Write 5 strings belonging to following functions
a. L1 U L2
b. L1 ∩ L2
c. L2 – L1
d. ⌐ (L2 – L1)
e. L1R

6. Show a possibly nondeterministic FSM to accept each of the following


languages:

A. {anbam : n, m ≥ 0, n ≡3 m}.
B. {w ∈ {a, b}* : w contains at least one instance of aaba, bbb or ababa}
C. L = {w ∈ {0-9}* : w represents the decimal encoding of a natural number
whose encoding contains, as a substring, the encoding of a natural number
that is divisible by 3}.
D. {w ∈ {0, 1}* : w contains both 101 and 010 as substrings}.
E. {w ∈ {0, 1}* : w corresponds to the binary encoding of a positive integer that
is divisible by 16 or is odd}.
F. {w ∈ {a, b, c, d, e}* : |w| ≥ 2 and w begins and ends with the same symbol}.
G. {w ∈{a, b}* : w has both aa and bb as a substrings}

7. Show an FSM (deterministic or nondeterministic) that accepts L = {w ∈ {a, b,


c}* : w contains at least one substring that consists of three identical symbols in a
row}. For example:
A. The following strings are in L: aabbb, baacccbbb.
B. The following strings are not in L: ε, aba, abababab, abcbcab.

8. Write the following for given language:


L = { w ∈{a, b}*: Every ‘a’ region in w is of even length}
a. State transition table
b. 5 Tuples
c. State diagram
d. 5 strings accepted by the language
e. 5 strings not accepted by the language

9. Write the following for given FSM:

a. State transition table


b. 5 Tuples
c. Language
d. 5 strings accepted by the language
e. 5 strings not accepted by the language

10. Show a deterministic FSM to accept each of the following languages. The
point of this exercise is to see how much harder it is to build a deterministic FSM
for tasks like these than it is to build an NDFSM. So do not simply build an
NDFSM and then convert it. But do, after you build a DFSM, build an equivalent
NDFSM.
A. {w ∈ {a, b}* : the fourth from the last character is a}.
B. {w ∈ {a, b}* : ∃x, y ∈ {a, b}* : ((w = x abbaa y) ∨ (w = x baba y))}.

11. For each of the following NDFSMs, use ndfsmtodfsm to construct an equivalent
DFSM. Begin by showing the value of eps(q) for each state q:

12. Let M be the following NDFSM. Construct (using ndfsmtodfsm), a DFSM that
accepts ¬L(M).
13. For each of the following languages L:
a. Describe the equivalence classes of ≈L.
b. If the number of equivalence classes of ≈L is finite, construct the minimal
DFSM that accepts L.
i. {w ∈ {0, 1}* : every 0 in w is immediately followed by the string 11}.
ii. {w ∈ {0, 1}* : w has either an odd number of 1’s and an odd number of 0’s or it
has an even number of 1’s and an even number of 0’s}.
iii. {w ∈ {a, b}* : w contains at least one occurrence of the string aababa}.
iv. {wwR : w ∈ {a, b}*}.
v. {w ∈ {a, b}* : w contains at least one a and ends in at least two b’s}.
vi. {w ∈ {0, 1}* : there is no occurrence of the substring 000 in w}.

14. Let M be the following DFSM. Use minDFSM to minimize M.

You might also like