Scribd
Upload
11 views1 page

DFA Design Exercises for Automata Theory

This document outlines a tutorial for the Formal Languages and Automata Theory course for the academic year 2023-24. It includes a series of questions requiring students to design Deterministic Finite Automata (DFA) and Finite Automata (FA) for various specified conditions over different alphabets. The tutorial aims to enhance students' understanding of computational models related to regular languages.

Uploaded by

rajrizvi734
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views1 page

DFA Design Exercises for Automata Theory

This document outlines a tutorial for the Formal Languages and Automata Theory course for the academic year 2023-24. It includes a series of questions requiring students to design Deterministic Finite Automata (DFA) and Finite Automata (FA) for various specified conditions over different alphabets. The tutorial aims to enhance students' understanding of computational models related to regular languages.

Uploaded by

rajrizvi734
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Academic Year 2023-24

Subject: Formal Languages and Automata Theory


Course: S.Y. BTech. I.T. Semester: IV Course Code: DJ19ITL402
Name: __________________________________________________
SapID: __________________________________________________
Batch: __________________________________________________

TUTORIAL NO. 1
Title: Designing DFA for given Regular Language or RE.
CO2: Students will be able to design computational model.

QUESTIONS:
1. Design a DFA to accept the strings that are starting with ‘baa’ over an alphabet ∑={a,b}.
2. Design a DFA to accept the strings that are ending with 0100 over an alphabet ∑={0,1}.
3. Design a DFA that accepts only those strings containing a substring ‘abab’ over an alphabet
∑={a,b}.
4. Design a DFA to accept the strings that are not starting with ‘aabb’ over an alphabet
∑={a,b}.
5. Design a DFA that rejects any string over ∑={0,1,2} where 2 is immediately preceded by a
0. It should accept all other strings (i.e. strings having substring 20 should be rejected).
6. Design a DFA to accept odd number of 1’s over an alphabet ∑={0,1}.
7. Design a DFA to accept even no of a’s and odd number of b’s over an alphabet ∑={a,b}.
8. Construct a FA to accept the decimal number divisible by 5.
9. Design a FA to determine whether a ternary number is divisible by 4. [Hint: ∑={0,1,2}]
10. Construct a minimal DFA which accepts,
L = { an bm cl | n,m,l >= 0 }
11. Design a DFA to accept the language,
L={w | w is of even length and begins with 01}

You might also like