diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-1.pdf new file mode 100644 index 0000000..2854ae1 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-2.pdf new file mode 100644 index 0000000..84b9aee Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA.pdf new file mode 100644 index 0000000..3051949 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Conversion of Epsilon NFA to NFA.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Conversion of Epsilon NFA to NFA.pdf new file mode 100644 index 0000000..0a129a4 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Conversion of Epsilon NFA to NFA.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Epsilon NFA.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Epsilon NFA.pdf new file mode 100644 index 0000000..6f0efb8 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Epsilon NFA.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Conversion of Epsilon NFA to NFA - Examples-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Conversion of Epsilon NFA to NFA - Examples-2.pdf new file mode 100644 index 0000000..4914c93 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Conversion of Epsilon NFA to NFA - Examples-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Epsilon NFA-NFA-Example3.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Epsilon NFA-NFA-Example3.pdf new file mode 100644 index 0000000..cf42938 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Epsilon NFA-NFA-Example3.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-1.pdf new file mode 100644 index 0000000..fe24413 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-2.pdf new file mode 100644 index 0000000..ba11be3 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-1.pdf new file mode 100644 index 0000000..a8b5049 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-2.pdf new file mode 100644 index 0000000..507d807 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Melay machine-3.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Melay machine-3.pdf new file mode 100644 index 0000000..7c98663 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Melay machine-3.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-1.pdf new file mode 100644 index 0000000..1d7b1e5 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-2.pdf new file mode 100644 index 0000000..4c6644e Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore machine-3.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore machine-3.pdf new file mode 100644 index 0000000..38d4522 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore machine-3.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine (Using Transition Table)-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine (Using Transition Table)-1.pdf new file mode 100644 index 0000000..06bc4bd Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine (Using Transition Table)-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -2.pdf new file mode 100644 index 0000000..75b04bf Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -3.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -3.pdf new file mode 100644 index 0000000..3e23379 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -3.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-1.pdf new file mode 100644 index 0000000..6f31b19 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-2.pdf new file mode 100644 index 0000000..8d3f468 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L1-TOC.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L1-TOC.pdf new file mode 100644 index 0000000..3984afc Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L1-TOC.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-3.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-3.pdf new file mode 100644 index 0000000..2da89f1 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-3.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-4.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-4.pdf new file mode 100644 index 0000000..84164ba Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-4.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L2-FSM.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L2-FSM.pdf new file mode 100644 index 0000000..1797e98 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L2-FSM.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L3-DFA-Example.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L3-DFA-Example.pdf new file mode 100644 index 0000000..a098057 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L3-DFA-Example.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L4-DFA-Example.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L4-DFA-Example.pdf new file mode 100644 index 0000000..f2fa88e Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L4-DFA-Example.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L5-DFA-Recognition.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L5-DFA-Recognition.pdf new file mode 100644 index 0000000..a99b4fc Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L5-DFA-Recognition.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L6-NFA-Introduction.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L6-NFA-Introduction.pdf new file mode 100644 index 0000000..ffdef70 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L6-NFA-Introduction.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-1.pdf new file mode 100644 index 0000000..d0ba81b Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-2.pdf new file mode 100644 index 0000000..1d3aaee Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L8-NFA-Example-3.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L8-NFA-Example-3.pdf new file mode 100644 index 0000000..25a67e3 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L8-NFA-Example-3.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-1.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-1.pdf new file mode 100644 index 0000000..26dfbf7 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-1.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-2.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-2.pdf new file mode 100644 index 0000000..45dbbe1 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-2.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion.pdf new file mode 100644 index 0000000..e058d58 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion.pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Formal Language Theory and Finite Automata) - Handwritten Notes.pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Formal Language Theory and Finite Automata) - Handwritten Notes.pdf new file mode 100644 index 0000000..a75c282 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Formal Language Theory and Finite Automata) - Handwritten Notes.pdf differ diff --git a/Notes/Unit 2 - Regular Expressions/TOC - Unit 2 (Regular Expressions) - Handwritten Notes.pdf b/Notes/Unit 2 - Regular Expressions/TOC - Unit 2 (Regular Expressions) - Handwritten Notes.pdf new file mode 100644 index 0000000..5075d41 Binary files /dev/null and b/Notes/Unit 2 - Regular Expressions/TOC - Unit 2 (Regular Expressions) - Handwritten Notes.pdf differ