The University of Faisalabad

Submitted by:
Daud Khalid (Bscs-fa18-015)
BSCS-6th

Subject:
THEORY OF AUTOMATA AND FORMAL LANGUAGES

Submitted to:
Mr. Zubair Tahir

Mid Exam Assignment

Department of Computational Science

Amin campus
Question: Consider the Language L*, Where L= {a, bb} How Many
words does this Language have of Length 4, 5, 6, 7 and 8. Write the Set of
words of each length asked.

Answer:

L= {a, bb}

Let

L*= {0, a,b,aa,bb,ba,ab,..….}

Words of length 4 = 5 words

L*= {aaaa,aaab,aabb,abba,bbbb}

Words of length 5 = 8 words

L*= {aaaaa, aabba,aaabb,abbaa,bbbbb,bbaaa,bbbaa,bbbba}

Words of length 6 =13 words

L*={aaaaaa,aaabba,abbaaa,bbabba,bbaabb,bbbbaa,bbaaaa,bbbbbb,
aabbaa,abbbba,abbabb,aabbba}

Words of length 7= 21 words

L*={aaaaaaa,bbbbbbb,aabbaaa,aaaabbaa,aaaabba,aaaaabb,bbbbaaa,
aaabbbb,abbabba,abbaabb,bbaabbk,bbbbbba,bbbbabb,bbabbbb, abbbbbb,bbabbaa,bbbbbba}

Words of length 8 = 34 words

L*= {bbbbbbbb,aaaaaaaa,abbaaaaaa,aabbaaaa,aaabbaaa,aaaaabba,
aaaaaabb,aaaaaabb,abbbbaaa,aaaabbbb,aabbabba,aabbbbaa,aaabbbba,abbaaabb,aabbaabb,ab
babbbb,aabbbbbb,abbbbabb,abbabbbb,
aabbbbb,abbabbak,abbbbbba,bbaaaaak,bbaaabba,bbaaaabb,
bbbbbbaa,bbbbabba,bbbbaabb,bbabbba,bbaabbbb,bbabbabb}
Question:  Draw a DFA which second last letter is ‘b’ if Σ= {a, b}
Answer:

a a

b a
q1 q3
q2
b

b
a

q4

Question: Convert a Moore Machine into Mealy Machine. What will be

output for given input and last state after completing the input string?
(Moore Machine diagram is on Question paper)
Input => 001001____ (Add Binary of Your Registration No. for example if
Reg. No. = BSCS-FA18-015)
Input = 001001(15)2  0010011111
0/a
Answer:
Converted Diagram

B
1/a 0/a, 1/a
0/a

D
A

1/b
0/a

C Mealy Machine Diagram

Outputaaaaaaaaaa 1/b