Formal Language Automata (All Units)
Formal Language Automata (All Units)
Must-Knows
- State Diagrams
- Transition Table
- Transition Rules
- Tuple Notations
Must-Prepare Topics
UNIT 1
- NFA & DFA Creation
- NFA to DFA Conversion
- Regular Expression to DFA
- DFA Minimization
- DFA to Regular Expression
UNIT 2 & 3
- Elimination of Useless Symbols, Epsilon & Unit Production
- CNF
- CNF to GNF
UNIT 4 & 5
- PDA
- Turing Machine
- PCP
Secondary Topics
UNIT 1
- Proof By Induction
- Language Acceptance
- Pumping Lemma
- Rijk Method Of Minimization
UNIT 4 & 5
- CFG to PDA
- PDA to CFG
- P, NP, NP-Hard & NP-Complete
Easy Topics To Complete
- Elimination of Useless Symbols, Epsilon & Unit Production
- PCP
- NFA & DFA Creation
- Language Acceptance
- Proof By Induction
Here is a link to the drive that has my handwritten notes named 'FLA 5 Units' for the open-book test.
It covers each topic with steps to solve and one example solution. Hope you find it useful.
I have also added another PDF named 'ALL' which you can use for reference.
Comments
Post a Comment