Scribd
Upload
133 views1 page

Assignment DFA

1. The document provides 12 questions asking to construct minimal deterministic finite automata (DFAs) that accept various languages over different alphabets and meeting certain criteria. Students are asked to submit handwritten solutions by March 24th, 2022 and upload a scanned PDF copy through a provided link. The questions involve DFAs accepting strings with symbols in certain positions, lengths divisible by or congruent to certain numbers, and starting or ending in certain patterns.

Uploaded by

Aditya Gaba
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
133 views1 page

Assignment DFA

1. The document provides 12 questions asking to construct minimal deterministic finite automata (DFAs) that accept various languages over different alphabets and meeting certain criteria. Students are asked to submit handwritten solutions by March 24th, 2022 and upload a scanned PDF copy through a provided link. The questions involve DFAs accepting strings with symbols in certain positions, lengths divisible by or congruent to certain numbers, and starting or ending in certain patterns.

Uploaded by

Aditya Gaba
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/ 1

Assignment 1 (TCS 402)

NOTE:

(I) Make handwritten solutions for given questions and submit before 24/03/2022.
(II) Also submit one scanned copy (in pdf form only) of your solution to give link
https://forms.gle/27YCTxT3wLMW1i4h9
1. Construct a minimal DFA over input symbol Ʃ = {0, 1} that accept all strings which have
the symbol 1 in second last position.
2. Construct a minimal DFA that accepts all the string of a's and b's where string contains
2a's consequently.
3. Construct a minimal DFA that accept all the string of a's & b's where each string contains
exactly 2a's consequently.
4. Construct a minimal DFA that accept all the string of a's and b's where every string ends
with "aa" or "bb".
5. Construct a minimal DFA that accept all the string of a's and b's where length of string is
divisible by 2 and 3.
6. Construct a minimal DFA that accept all the string of a's and b's where length of string is
divisible by 2 or 3.
7. Draw a DFA for a language L = (ab ∪ aba)* where Ʃ = {a, b}
8. Construct a minimal DFA over input symbol Ʃ = {a, b} such that it accepts all the string
starting with ‘ab’ and length |w| = 3 mod 4.
9. Construct a minimal DFA that accept all the binary number which is congruent to 1 mod
4.
10. Construct a minimal DFA that accept all the number of base 3, which are divisible by 3.
11. Construct a DFA accepting all string w over {0, 1} such that the number of 1’s in w is 3
mod 4.
12. Construct the minimal DFA over Ʃ = {a}*, which accept L= { an / n>0, n ≠ 2, n ≠ 4 }

You might also like