Added content.

Browse Source

- Assignments
- Notes
- Question papers
- DISCLAIMER and motto
Lastly, updated README file.

...

This commit is contained in:

K

2025-01-07 17:04:39 +05:30

parent c092f96d5f

commit 862c89e0b8

76 changed files with 57 additions and 0 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-11 Minimization of DFA.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Conversion of Epsilon NFA to NFA.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-12 Epsilon NFA.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Conversion of Epsilon NFA to NFA - Examples-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-13 Epsilon NFA-NFA-Example3.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-14 Mealy and Moore State Machines-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-15 Construction of Melay machine-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Melay machine-3.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore Machine-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-16 Construction of Moore machine-3.pdf

BIN

Binary file not shown.

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

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-17 Conversion of Mealy Machine to Moore Machine -3.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L-18 Conversion of Moore Machine to Mealy Machine-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L1-TOC.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-3.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L10-NFA-DFA Conversion Example-4.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L2-FSM.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L3-DFA-Example.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L4-DFA-Example.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L5-DFA-Recognition.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L6-NFA-Introduction.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L7-NFA-Example-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L8-NFA-Example-3.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-1.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion Example-2.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/Class Presentations/L9-NFA-DFA Conversion.pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Kalaskar).pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Class Notes) (from Macho).pdf

BIN

Binary file not shown.

Notes/Unit 1 - Formal Language Theory and Finite Automata/TOC - Unit 1 (Formal Language Theory and Finite Automata) - Handwritten Notes.pdf

BIN

Binary file not shown.

Notes/Unit 2 - Regular Expressions/TOC - Unit 2 (Regular Expressions) - Handwritten Notes.pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L1-Context Free Grammar & Context Free Language.pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.1-Simplification of CFG (Reduction of CFG).pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.2-Simplication of CFG (Removal of Unit Productions).pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L2.3-Simplication of CFG (Removal of NULL Productions).pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.1-Derivation Tree (Left & Right Derivation Trees).pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.2-Ambiguous Grammar.pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L3.3-Chomsky Normal Form & CFG to CNF Conversion.pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.1-Conversion of CFG to Chomsky Normal Form.pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L4.2-Greibach Normal Form & CFG to GNF Conversion.pdf

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/Class Presentations/L5-CFG to GNF Conversion (Removal of Left Recursion).pdf

BIN

Binary file not shown.

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

BIN

Binary file not shown.

Notes/Unit 3 - Context Free Grammar (CFG) and Context Free Language (CFL)/TOC - Unit 3 (Topic - Applications of CFG).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.0 - Pushdown Automata (Introduction).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.1 - Pushdown Automata (Formal Definition).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L1.2 - Pushdown Automata (Graphical Notation).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.1 - Pushdown Automata Example (Even Palindrome).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L2.2 - Automata Example (Even Palindrome).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L3 - Pushdown Automata Example.pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.1 - Equivalence of CFG and PDA.pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L4.2 - Equivalence of CFG and PDA.pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L5 - PDA to CFG.pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/Class Presentations/L6 - PDA to CFG (Examples).pdf

BIN

Binary file not shown.

Notes/Unit 4 - Pushdown Automata (PDA)/TOC - Unit 4 (Pushdown Automata) - MCQs.pdf

BIN

Binary file not shown.