Scribd
Upload
53 views

Assignment of Theory of Automata

This is a assignment of university of Lahore of theory of automata very important questions are included in this assignment

Uploaded by

Abdul Manan Mustafa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
53 views

Assignment of Theory of Automata

This is a assignment of university of Lahore of theory of automata very important questions are included in this assignment

Uploaded by

Abdul Manan Mustafa
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Theory of Automata

Assignment # 2
Due Date: 02/11/2019 Total Marks: 30

Program: BSCS
Instructions
1. Understanding of the problems is part of the assignments. So no query please.
2. You will get Zero marks if found any type of cheating.
3. 25 % deduction of over marks on the one day late submission after due date
4. 50 % deduction of over marks on the two day late submission after due date
5. No submission after two days.

Q. Construct DFA’s for Following languages

When = {a, b}

i. The language of all words that contains substring ‘abba’.


ii. All words that start with ‘a’ has odd length and start with ‘b’ and has even length.
iii. All words does not start and end with double letter.
iv. All words with even lengths and b occupies all odd positions.
v. Any string except ‘aaa; and ‘bbb’.

When  = {0, 1}

vi. {w : | W | mod 3 ≠ 0}
vii. {w : | W | mod 2 = 0}
viii. {w contains at least two ‘0’ and at most one ‘1’}

DO the Following as directed

ix. The set of all words over the English alphabet (lower case) whose third last letter is ‘z’.
x. Design a DFA machine that accept the all language ( or strings) which are divisible by 2 over
the input alphabet  = {0, 1,2,3,4,5,6,7,8,9} i.e. the sum of these number is divisible by 2.
2, 13, 31, 4, 22, 51,15, 123, ….etc are some valid strings

You might also like