Unit 1: Formal Language & Finite Automata | SPPU S.E. Comp & I.T.

Notes Link: https://shorturl.at/qvpWC

Notes are in online format.

Instagram: https://www.instagram.com/harischaus
LinkedIn: https://in.linkedin.com/in/haris-chaus-721734208

Finite Automata (FA):
An informal picture of FA
Finite State Machine (FSM)
Language accepted by FA
Definition of Regular Language.

FA without output
Deterministic and Nondeterministic FA (DFA and NFA)
Epsilon- NFA and Inter-conversion
Minimization of DFAs.

FA with output: Moore and Mealy machines
Definition
Models
Inter-Conversion

TOC Oneshot
Formal Language Theory & Finite Automata Oneshot

SPPU Insem Exam
TOC Insem Exam
SPPU Insem Exam
Computer Engineering
Artificial Intelligence and Data Science
Information Technology