Boost Your CGPA With Knowledge
Tel No. (+91) 7015535114
CGPA BOOSTER
Home
About us
Coding Lab
AcadBoost
knowledge Base
Career Guidance
FORMAL LANGUAGES AND AUTOMATION THEORY
.
UNIT 1
Click Here
HandWritten Notes
PPT Notes 01
PPT Notes 02
PPT Notes 03
PPT Notes 04
PPT Notes 05
PPT Notes 06
UNIT 2
Click Here
HandWritten Notes
PPT Notes 01
PPT Notes 02
PPT Notes 03
PPT Notes 04
PPT Notes 05
PPT Notes 06
PPT Notes 07
PPT Notes 08
UNIT 3
Click Here
HandWritten Notes
Chomsky classification of languages
Chomsky Hierarchy
ChomskyPresentation
Equivalence of FA and RE
Left _ Right linear regular grammar
regulargrammars
UNIT 4
Click Here
HandWritten Notes
Ambiguity in grammar
Construction of reduced grammar
Converting RE to RG _ RG to RE
Normal formsCNF _ GNF
Deterministic _ NonDeterministic PDA
CNF & GNF
UNIT 5
Click Here
HandWritten Notes
Acceptance by PDA
Deterministic _ NonDeterministic PDA
PDA
Top down _ Bottom up parsing
UNIT 6
Click Here
HandWritten Notes
uring Machine
Turing machine model_Representation
Concept of Computability
Design of turing machine
Halting problem of TM _ PCP
Linear Bounded automaton and NDTM
Recursive and Recursively Enumerable sets
UNIT VI TURING MACHINES
BOOK
Click Here
BOOK 01
Practice Questions
Click Here
Sample MCQ 01
Sample MCQ 02