Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
5 views1 page

TOA Assignment 1-1

The document outlines an assignment for the Theory of Automata and Formal Languages course at the United Institute of Technology for the session 2024-25. It includes a list of questions related to Deterministic Finite Automata (DFA), Non-deterministic Finite Automata (NFA), and machines with outputs, with a submission deadline of April 21, 2025. Each question is associated with a specific Course Outcome (CO) and Bloom's taxonomy level.

Uploaded by

tiwarinitish960
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
5 views1 page

TOA Assignment 1-1

The document outlines an assignment for the Theory of Automata and Formal Languages course at the United Institute of Technology for the session 2024-25. It includes a list of questions related to Deterministic Finite Automata (DFA), Non-deterministic Finite Automata (NFA), and machines with outputs, with a submission deadline of April 21, 2025. Each question is associated with a specific Course Outcome (CO) and Bloom's taxonomy level.

Uploaded by

tiwarinitish960
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

United Institute of Technology, Naini, Prayagraj

Department of CSE/CSE(AIML)
Session 2024-25 (Even Sem)
Theory of Automata and Formal Languages (BCS-402)

Last Date of Submission: 21/04/2025

Assignment-1
Q. Question CO Bloom’s
No. level
1 Define DFA with one example. CO1 K2
2 Define NFA or NDFA with one example. CO1 K2
3 Construct a DFA which accepts all strings that ends with 11 over ∑={0,1} CO1 K3
4 Construct a DFA which accepts all strings that starts with 00 over ∑={0,1} CO1 K3
5 Construct a DFA that accepts all strings that starts and ends with a or starts and ends CO1 K3
with b over ∑ ={a,b}
6 Construct a DFA which accepts all strings containing aba as substring over ∑ ={a,b} CO1 K3
7 Construct a DFA for na(w)mod4=3 . Where w is any string over ∑ ={a,b} CO1 K3
8 Construct NFA which accepts all strings containing 011 as substring over ∑ ={0,1}. CO1 K3
9 Define Mealy Machine and Moore Machine ( FA with output ). CO1 K3
10 Convert following Mealy Machine into its equivalent Moore Machine CO1 K2

You might also like