Scribd
Upload
3 views

Assignment#2

Theory of automata assignment questions solved

Uploaded by

Bakhtawar Tariq
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Assignment#2

Theory of automata assignment questions solved

Uploaded by

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

Advance Theory of Computation

Dr. Abdus Salam


Assignment # 2
_____________________________________________________________________________________
Construct deterministic finite automata (DFA) accepting each of the following languages over
the alphabet ∑ = {a, b}. Give computation of string provided in each part.

1. L1=Set of strings with exactly two b’s. Compute δ*(q0, abaaba)=?


2. L2=Set of strings with at least two b’s. Compute δ*(q0, bbababbb)=?
3. L3=Set of strings that end in double letters. Compute δ*(q0, bababaa)=?
4. L4=Set of strings having total number of a’s divisible by 3. Compute δ*(q0, baabaabaa)=?
5. L5={w | w  {a, b}* | w has both ab & ba as substrings}. Compute δ*(q0, abaabbb)=?

Give NFA’s/ε-NFAs accepting each of the following languages over the alphabet {0, 1}.

6. L6=Set of all strings either ending in 00 or 11. Compute δ*(q0, 1011100)=?


7. L7=Set of all strings having three consecutive 0’s. Compute δ*(q0, 10100010)=?
8. L8=Set of strings with 011 or 110 as a substring. Compute δ*(q0, 1011100)=?
9. L9=Set of strings of binary numbers that is divisible by three. Compute δ*(q0, 1001)=?
10. L10=Set of strings having different first and last letters. If a word begins with a 0, to be
accepted it must end with a 1 and vice versa. Compute δ*(q0, 1011100)=?

You might also like