Formal Languages And Automata Theory (FLAT) Important Units & Check List
Unit II - Finite AutomataCheck List after study
NFA and DFA
NFA to DFA conversions
Finite State Machines
Moore and Melay Machines
Check List after study
Construction of Finite Automata
Regular Expressions
Closure Properties
Pumping Lemma
Check List after study
Regular grammars
Regular linear grammar and FA Equivalence
Context free grammar
Right most and leftmost derivation of strings
Check List after study
Minimisation of Context Free Grammars
Chomsky normal form
Greiback normal form
Context Free Languages
Check List after study
Def. and Model of PDA
Acceptance of Finine Stae
Euqivalance of CFL and PDA
Conversions
Def. and Model of Turing Machine
Church’s hypothesis
Types of Turing machines
Computable Functions
NFA to DFA conversions
Finite State Machines
Moore and Melay Machines
Unit III - Regular Languages
Check List after study
Construction of Finite Automata
Regular Expressions
Closure Properties
Pumping Lemma
Unit IV - Grammar Formalism
Check List after study
Regular grammars
Regular linear grammar and FA Equivalence
Context free grammar
Right most and leftmost derivation of strings
Unit V - Context Free Grammars
Check List after study
Minimisation of Context Free Grammars
Chomsky normal form
Greiback normal form
Context Free Languages
Unit VI - Push Down Automata
Check List after study
Def. and Model of PDA
Acceptance of Finine Stae
Euqivalance of CFL and PDA
Conversions
Unit VII - Turing MachineCheck List after study
Church’s hypothesis
Types of Turing machines
Computable Functions
0 comments:
Post a Comment