Scribd
Upload
17 views4 pages

TE TOC Assignment1

The document outlines Assignment No. 1 for the Theory of Computation course at ISBM College of Engineering for the academic year 2024-25. It includes questions on Finite State Machines, Regular Languages, comparisons between different types of finite automata, and the distinction between Moore and Mealy machines. The assignment is supervised by Dr. S M Khaja and Dr. Vilas Joshi.

Uploaded by

kalpeshpatil1707
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
17 views4 pages

TE TOC Assignment1

The document outlines Assignment No. 1 for the Theory of Computation course at ISBM College of Engineering for the academic year 2024-25. It includes questions on Finite State Machines, Regular Languages, comparisons between different types of finite automata, and the distinction between Moore and Mealy machines. The assignment is supervised by Dr. S M Khaja and Dr. Vilas Joshi.

Uploaded by

kalpeshpatil1707
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/ 4

Peoples Empowerment Group

ISBM COLLEGE OF ENGINEERING, NANDE, PUNE


Department of Computer Engineering
Academic Year 2024-25

Class: TE Computer Engg. Subject: Theory of Computation (310242)


Semester: I
Unit I: Formal Language Theory and Finite Automata Programming

Assignment No. 1

1. Explain Finite State Machine (FSM)


2. Define regular Language and what is the language accepted by FA
3. Compare Deterministic and Nondeterministic FA (DFA and NFA)
4. Compare epsilon- NFA and inter-conversion
5. Differentiate Moore and Mealy machines

Subject In charge HOD


Dr S M Khaja Dr Vilas Joshi
Peoples Empowerment Group
ISBM COLLEGE OF ENGINEERING, NANDE, PUNE
Department of Computer Engineering
Academic Year 2024-25

Class: TE Computer Engg. Subject: Theory of Computation (310242)


Semester: I
Unit I: Formal Language Theory and Finite Automata Programming

Assignment No. 1

1. What is Finite State Machine (FSM)


2. Define Regular Language and what is the language accepted by FA
3. Differentiate Deterministic and Nondeterministic FA (DFA and NFA)
4. Compare and contrast epsilon- NFA and inter-conversion
5. Illustrate Moore and Mealy machines with examples

Subject In charge HOD


Dr S M Khaja Dr Vilas Joshi
Peoples Empowerment Group
ISBM COLLEGE OF ENGINEERING, NANDE, PUNE
Department of Computer Engineering
Academic Year 2024-25

Class: TE Computer Engg. Subject: Theory of Computation (310242)


Semester: I
Unit I: Formal Language Theory and Finite Automata Programming

Assignment No. 1

1. How Finite State Machine (FSM) works?


2. Define Regular Language and what is the language accepted by FA
3. Explain FA without output
4. Compare and contrast epsilon- NFA and inter-conversion
5. Illustrate Moore and Mealy machines with examples

Subject In charge HOD


Dr S M Khaja Dr Vilas Joshi
Peoples Empowerment Group
ISBM COLLEGE OF ENGINEERING, NANDE, PUNE
Department of Computer Engineering
Academic Year 2024-25

Class: TE Computer Engg. Subject: Theory of Computation (310242)


Semester: I
Unit I: Formal Language Theory and Finite Automata Programming

Assignment No. 1

1. How Finite State Machine (FSM) works?


2. Define Regular Language and what is the language accepted by FA
3. Explain FA without output
4. Compare and contrast epsilon- NFA and inter-conversion
5. Explain FA with output in detail

Subject In charge HOD


Dr S M Khaja Dr Vilas Joshi

You might also like