Scribd
Upload
68 views2 pages

TAFL Assignment 1 2024-25

The document is an assignment from the Department of Computer Science and Engineering at Meerut Institute of Engineering and Technology, focusing on finite automata (FA) and related concepts. It includes various questions requiring the design of finite automata, drawing DFAs for specific languages, constructing minimum state automata, and explaining the Myhill-Nerode theorem. The assignment is due on May 30, 2025, and references previous academic years for context.

Uploaded by

Sameera Ahmad
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
68 views2 pages

TAFL Assignment 1 2024-25

The document is an assignment from the Department of Computer Science and Engineering at Meerut Institute of Engineering and Technology, focusing on finite automata (FA) and related concepts. It includes various questions requiring the design of finite automata, drawing DFAs for specific languages, constructing minimum state automata, and explaining the Myhill-Nerode theorem. The assignment is due on May 30, 2025, and references previous academic years for context.

Uploaded by

Sameera Ahmad
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

MEERUT INSTITUTE OF ENGINEERING AND TECHNOLOGY, MEERUT

DEPARTMENT OF CSE

SUB : TAFL SUB CODE: BCS 402 Submission Date: 30/05/2025

ASSIGNMENT- 01

Q1. Design a FA to accept the string that always ends with 101.

Q2. Draw the finite automata which accepts all the strings containing both 11 and 010 as substrings.
(AKTU 2022-23)

Q3. Draw DFA of the following language over {0,1} :– (i) All strings with even no. of 0's and even
no. of 1's. (ii) All strings of length at most 5. (AKTU 2018-19)

Q4. Draw DFA for the following that accepts strings on {0,1} (i) mod 3 = 0 | w (ii) mod 3 > 0 |w, (iii)
mod 3 > 1|ω, where w represents length of string.

Q5. Construct a minimum state automata equivalent to a DFA whose transition table is as follows
where q3 and q4 are final state. (AKTU 2022-23)

Q6. Construct a Non Deterministic Finite Automation (NFA) for the language L which accepts all the
strings in which the third symbol from right end is always 'a' over Σ = {a, b}.

Q7. Explain in detail about the Myhill-Nerode theorem using suitable example. (AKTU 2021-22)

Q8. (AKTU 2021-22)


Q9. (AKTU 2017-18)

Q10. Design a Moore and Mealy machine which calculate residue mode 4 for each binary string
treated as binary integer. (AKTU 2017-18)

You might also like