diff --git a/Assignments/TOC - Assignment 1.pdf b/Assignments/TOC - Assignment 1.pdf new file mode 100644 index 0000000..b25a8dc Binary files /dev/null and b/Assignments/TOC - Assignment 1.pdf differ diff --git a/Assignments/TOC - Assignment 2.pdf b/Assignments/TOC - Assignment 2.pdf new file mode 100644 index 0000000..0a64478 Binary files /dev/null and b/Assignments/TOC - Assignment 2.pdf differ diff --git a/DISCLAIMER.md b/DISCLAIMER.md new file mode 100644 index 0000000..f34a619 --- /dev/null +++ b/DISCLAIMER.md @@ -0,0 +1,13 @@ +# DISCLAIMER + +Disclaimer for [TheoryOfComputation](https://git.kska.io/sppu-te-comp-content/TheoryOfComputation) repository under [sppu-te-comp-content](https://git.kska.io/sppu-te-comp-content) organization. + +--- + +- Please be advised that this repository ([TheoryOfComputation](https://git.kska.io/sppu-te-comp-content/TheoryOfComputation)), its organization ([sppu-te-comp-content](https://git.kska.io/sppu-te-comp-content)), and all of its content are entirely independent and not associated to, and/or affiliated with SPPU (Savitrbai Phule Pune University, Pune) and/or any of its colleges, nor with [KSKA Git](https://git.kska.io). The materials provided within, including assignments from our contributors and notes from our professors, are solely for educational purposes and convenience. + +- KSKA Git serves merely as a platform for this content and does not imply any association and/or endorsement from SPPU or KSKA Git. It is important to recognize that the organization (sppu-te-comp-content) and all of its repositories in KSKA Git operates independently, and any references to educational institutions or platforms are purely for informational clarity. + +- Furthermore, it is emphasized that the content available within this repository remains meticulously curated to align with the latest 2019 SPPU syllabus for computer engineering. Our commitment to accuracy ensures that the materials provided reflect the current academic standards prescribed by SPPU, offering students a reliable resource to supplement their studies. + +--- 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 (Class Notes) (from Kalaskar).pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Kalaskar).pdf new file mode 100644 index 0000000..6bc45e0 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Kalaskar).pdf differ diff --git a/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Macho).pdf b/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Macho).pdf new file mode 100644 index 0000000..4602235 Binary files /dev/null and b/Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Macho).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 diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L1-Context Free Grammar & Context Free Language.pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L1-Context Free Grammar & Context Free Language.pdf new file mode 100644 index 0000000..bc0fe0c Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L1-Context Free Grammar & Context Free Language.pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.1-Simplification of CFG (Reduction of CFG).pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.1-Simplification of CFG (Reduction of CFG).pdf new file mode 100644 index 0000000..5d8ffc2 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.1-Simplification of CFG (Reduction of CFG).pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.2-Simplication of CFG (Removal of Unit Productions).pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.2-Simplication of CFG (Removal of Unit Productions).pdf new file mode 100644 index 0000000..081fe35 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.2-Simplication of CFG (Removal of Unit Productions).pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.3-Simplication of CFG (Removal of NULL Productions).pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.3-Simplication of CFG (Removal of NULL Productions).pdf new file mode 100644 index 0000000..a39412a Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.3-Simplication of CFG (Removal of NULL Productions).pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.1-Derivation Tree (Left & Right Derivation Trees).pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.1-Derivation Tree (Left & Right Derivation Trees).pdf new file mode 100644 index 0000000..4d53759 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.1-Derivation Tree (Left & Right Derivation Trees).pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.2-Ambiguous Grammar.pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.2-Ambiguous Grammar.pdf new file mode 100644 index 0000000..1c8dd65 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.2-Ambiguous Grammar.pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.3-Chomsky Normal Form & CFG to CNF Conversion.pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.3-Chomsky Normal Form & CFG to CNF Conversion.pdf new file mode 100644 index 0000000..d8b694c Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.3-Chomsky Normal Form & CFG to CNF Conversion.pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.1-Conversion of CFG to Chomsky Normal Form.pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.1-Conversion of CFG to Chomsky Normal Form.pdf new file mode 100644 index 0000000..34b9c7f Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.1-Conversion of CFG to Chomsky Normal Form.pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.2-Greibach Normal Form & CFG to GNF Conversion.pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.2-Greibach Normal Form & CFG to GNF Conversion.pdf new file mode 100644 index 0000000..c4f15f5 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.2-Greibach Normal Form & CFG to GNF Conversion.pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L5-CFG to GNF Conversion (Removal of Left Recursion).pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L5-CFG to GNF Conversion (Removal of Left Recursion).pdf new file mode 100644 index 0000000..d025a23 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L5-CFG to GNF Conversion (Removal of Left Recursion).pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Context Free Grammar (CFG) and Context Free Language (CFL)) - Handwritten Notes.pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Context Free Grammar (CFG) and Context Free Language (CFL)) - Handwritten Notes.pdf new file mode 100644 index 0000000..64c1bb7 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Context Free Grammar (CFG) and Context Free Language (CFL)) - Handwritten Notes.pdf differ diff --git a/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Topic - Applications of CFG).pdf b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Topic - Applications of CFG).pdf new file mode 100644 index 0000000..f6da9e6 Binary files /dev/null and b/Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Topic - Applications of CFG).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.0 - Pushdown Automata (Introduction).pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.0 - Pushdown Automata (Introduction).pdf new file mode 100644 index 0000000..8c31f41 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.0 - Pushdown Automata (Introduction).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.1 - Pushdown Automata (Formal Definition).pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.1 - Pushdown Automata (Formal Definition).pdf new file mode 100644 index 0000000..add55d4 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.1 - Pushdown Automata (Formal Definition).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.2 - Pushdown Automata (Graphical Notation).pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.2 - Pushdown Automata (Graphical Notation).pdf new file mode 100644 index 0000000..b2464fd Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.2 - Pushdown Automata (Graphical Notation).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.1 - Pushdown Automata Example (Even Palindrome).pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.1 - Pushdown Automata Example (Even Palindrome).pdf new file mode 100644 index 0000000..28d069c Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.1 - Pushdown Automata Example (Even Palindrome).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.2 - Automata Example (Even Palindrome).pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.2 - Automata Example (Even Palindrome).pdf new file mode 100644 index 0000000..8e78477 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.2 - Automata Example (Even Palindrome).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L3 - Pushdown Automata Example.pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L3 - Pushdown Automata Example.pdf new file mode 100644 index 0000000..599b741 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L3 - Pushdown Automata Example.pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.1 - Equivalence of CFG and PDA.pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.1 - Equivalence of CFG and PDA.pdf new file mode 100644 index 0000000..f0abf2a Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.1 - Equivalence of CFG and PDA.pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.2 - Equivalence of CFG and PDA.pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.2 - Equivalence of CFG and PDA.pdf new file mode 100644 index 0000000..ad45880 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.2 - Equivalence of CFG and PDA.pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L5 - PDA to CFG.pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L5 - PDA to CFG.pdf new file mode 100644 index 0000000..72e36bf Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L5 - PDA to CFG.pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L6 - PDA to CFG (Examples).pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L6 - PDA to CFG (Examples).pdf new file mode 100644 index 0000000..5465695 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L6 - PDA to CFG (Examples).pdf differ diff --git a/Notes/Unit 4 - Pushdown Automata (PDA)/TOC - Unit 4 (Pushdown Automata) - MCQs.pdf b/Notes/Unit 4 - Pushdown Automata (PDA)/TOC - Unit 4 (Pushdown Automata) - MCQs.pdf new file mode 100644 index 0000000..6b416e9 Binary files /dev/null and b/Notes/Unit 4 - Pushdown Automata (PDA)/TOC - Unit 4 (Pushdown Automata) - MCQs.pdf differ diff --git a/Question Papers/END-SEM/TOC - 2022 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2022 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..08bb8bd Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2022 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/END-SEM/TOC - 2022 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2022 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..5ffff97 Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2022 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/END-SEM/TOC - 2022 - November-December - SOLVED END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2022 - November-December - SOLVED END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..8d60d4a Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2022 - November-December - SOLVED END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/END-SEM/TOC - 2023 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2023 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..bef6050 Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2023 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/END-SEM/TOC - 2023 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2023 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..37e5133 Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2023 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/END-SEM/TOC - 2024 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2024 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..e66c4b3 Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2024 - May-June - END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/END-SEM/TOC - 2024 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/END-SEM/TOC - 2024 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..7cb8f99 Binary files /dev/null and b/Question Papers/END-SEM/TOC - 2024 - November-December - END-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/IN-SEM/TOC - 2022 - October - IN-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/IN-SEM/TOC - 2022 - October - IN-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..13b447c Binary files /dev/null and b/Question Papers/IN-SEM/TOC - 2022 - October - IN-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/IN-SEM/TOC - 2024 - October - IN-SEM (SEM-5) (2019 Pattern).pdf b/Question Papers/IN-SEM/TOC - 2024 - October - IN-SEM (SEM-5) (2019 Pattern).pdf new file mode 100644 index 0000000..45e86ec Binary files /dev/null and b/Question Papers/IN-SEM/TOC - 2024 - October - IN-SEM (SEM-5) (2019 Pattern).pdf differ diff --git a/Question Papers/TOC - Unit Test Sample Paper (IN-SEM, 2019 Pattern).pdf b/Question Papers/TOC - Unit Test Sample Paper (IN-SEM, 2019 Pattern).pdf new file mode 100644 index 0000000..19dac19 Binary files /dev/null and b/Question Papers/TOC - Unit Test Sample Paper (IN-SEM, 2019 Pattern).pdf differ diff --git a/README.md b/README.md index c5e4f2c..b632288 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,47 @@ # Theory of Computation (TOC) +This repository is a comprehensive resource for the Theory of Computation (TOC) course under the SPPU 2019 pattern. It covers essential topics such as formal languages, translation logic, and the design of computational models, including Finite Automata, Pushdown Automata, and Turing Machines. You will learn to construct regular expressions, Context Free Grammars, and explore concepts like the Pumping Lemma and NP completeness, equipping them with the theoretical and practical skills needed for effective computational analysis and design. + +--- + +> [!TIP] +> Want to contribute? Start by [opening an issue](https://git.kska.io/sppu-te-comp-content/TheoryOfComputation/issues) in this repository! + +## Index + +### Notes +1. [Unit 1 - Formal Language Theory and Finite Automata](Notes/Unit%201%20-%20Formal%20Language%20Theory%20and%20Finite%20Automata) +2. [Unit 2 - Regular Expressions](Notes/Unit%202%20-%20Regular%20Expressions) +3. [Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)](Notes/Unit%203%20-%20Context%20Free%20Grammar%20%28CFG%29%20and%20Context%20Free%20Language%20%28CFL%29) +4. [Unit 4 - Pushdown Automata (PDA)](Notes/Unit%204%20-%20Pushdown%20Automata%20%28PDA%29) + +### Assignments +1. [Assignment - 1](Assignments/TOC%20-%20Assignment%201.pdf) +2. [Assignment - 2](Assignments/TOC%20-%20Assignment%202.pdf) + +### Question Papers +- [IN-SEM](Question%20Papers/IN-SEM) +- [END-SEM](Question%20Papers/END-SEM) + +> [Sample IN-SEM Unit Test Paper](Question%20Papers/TOC%20-%20Unit%20Test%20Sample%20Paper%20%28IN-SEM%2C%202019%20Pattern%29.pdf) + +--- + +## Miscellaneous + +**-> Disclaimer:** Please read the [DISCLAIMER](DISCLAIMER.md) file for important information regarding the contents of this repository. + +**-> Note:** Content such as assignments and question papers is provided by us, i.e. our contributors. You are free to use this content however you wish, without any restrictions. Some of the notes have been provided by our professors, thus to use them for anything other than educational purposes, please contact them. + +**-> Maintained by:** +- [notkshitij](https://git.kska.io/notkshitij) + +**-> Motto:** + +![Making information freely accessible to everyone.](motto.jpg) + +**-> Keywords:** + +SPPU, Savitribai Phule Pune University, Pune University, Computer Engineering, COMP, Third Year, TE, Semester 5, SEM-5, Theory of Computation, TOC, TOC assignments, TOC assignment solutions, TOC notes, TOC PYQs, TOC question papers + --- diff --git a/motto.jpg b/motto.jpg new file mode 100644 index 0000000..3728db1 Binary files /dev/null and b/motto.jpg differ