Scribd
Upload
39 views2 pages

Assignment

The assignment for the Formal Languages and Automata course requires students to answer questions related to DFA design, NFA conversion, PDA construction, and Turing machines. It emphasizes neat presentation and submission of a separate register for assessment. The document outlines specific tasks across four units, including examples and theoretical explanations.

Uploaded by

Shaito Sakti
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
39 views2 pages

Assignment

The assignment for the Formal Languages and Automata course requires students to answer questions related to DFA design, NFA conversion, PDA construction, and Turing machines. It emphasizes neat presentation and submission of a separate register for assessment. The document outlines specific tasks across four units, including examples and theoretical explanations.

Uploaded by

Shaito Sakti
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
You are on page 1/ 2

ASSIGNMENT

SUBJECT: Formal Languages and Automata


SESSION: 2024-2025
BRANCH:CSE
SEMESTER :5th
SECTION:I,II,III
Prepared By: Ms. Sukrati Chaturvedi
Date of Submission: 4th November 2024

Note: 1. Student is required to attempt all questions with neat and clean representation of the answers to the
asked questions of the assignment. The purpose of the assignment is to enable the student to write
appropriate response to question relevant to final end-semester university examination.
2. Separate register for the assignment need to be submitted so that the same could be considered for
teacher assessment marks by the subject teacher.

UNIT 1

1 Design DFA for language L = {0^m1^n | n ≥ 4}.


2 Minimize DFA.

UNIT 2
1. Provide step-by-step examples to convert the following regular expressions to NFAs:
a. (a+b)*abb
b. (0+1)*0(0+1)(0+1)
2. Write a recursive regular expression to represent the language of all strings over {a, b}
containing an equal number of 'a's and 'b's.

UNIT 3

1 Construct a PDA for language L = {0 n1m | n >= 1, m >= 1, m > n+2}


2 2 Explain the Chomsky hierarchy of languages and its classification into four types. Provide
examples of languages that fall into each type.

UNIT 4
1 Design a Tring machine to recognize the following language: L={anbncn | n>=1}.
2 Design a Turing Machine to check whether a given number is divisible by ‘3’ or not.
3 Discuss the difference between deterministic Turing machines (DTM) and non-deterministic
Turing machines (NTM). Are there any differences in their computational power?

You might also like