switch to basic browser
📂
📝
📟

🌲 / tcs intcs Year 2 Module 7 - Discrete Structures and Efficient Algorithms Languages and Machines Lecture Slides

c File Name Size files T Date
-Lecture 1 - Languages, Regular Expressions, Automata - Handout.pdf462468pdf2026-04-07 16:53:03
-Lecture 1 - Languages, Regular Expressions, Automata - Slides.pdf865304pdf2026-04-07 16:53:05
-Lecture 2 - Non-Deterministic Finite Automata - Handout.pdf259301pdf2026-04-07 16:53:06
-Lecture 2 - Non-Deterministic Finite Automata - Slides.pdf657337pdf2026-04-07 16:53:07
-Lecture 3 - Regular Languages, Pumping Lemma, Minimisation - Handout.pdf180442pdf2026-04-07 16:53:09
-Lecture 3 - Regular Languages, Pumping Lemma, Minimisation - Slides.pdf452231pdf2026-04-07 16:53:10
-Lecture 4 - Appendix - Product automation, Paralell Composition, Hiding - Handout.pdf180206pdf2026-04-07 16:53:12
-Lecture 4 - Parallel Composition of Automata and Grammars - Handout.pdf369124pdf2026-04-07 16:53:13
-Lecture 4- Parallel Composition of Automata and Grammars - Slides.pdf1046183pdf2026-04-07 16:53:15
-Lecture 5 - Chomsky Normal Form and CYK Parsing - Handout.pdf183605pdf2026-04-07 16:53:16
-Lecture 5 - Chomsky Normal Form and CYK Parsing - Slides.pdf727804pdf2026-04-07 16:53:18
-Lecture 6 - Pushdown Automata (PDA) and Context-Free Languages - Handout.pdf153545pdf2026-04-07 16:53:19
-Lecture 6 - Pushdown Automata (PDA) and Context-Free Languages.pdf763120pdf2026-04-07 16:53:20
-Lecture 7 - Beyond Context-Free Languages - Pumping Lemma for CFG and Turing Machines - Handout.pdf176973pdf2026-04-07 16:53:22
-Lecture 7 - Beyond Context-Free Languages - Pumping Lemma for CFG and Turing Machines - Slides.pdf544737pdf2026-04-07 16:53:23
-Lecture 8 - Turing Machines and Unrestricted Grammars - Handout.pdf480931pdf2026-04-07 16:53:25
-Lecture 8 - Turing Machines and Unrestricted Grammars - Slides.pdf787610pdf2026-04-07 16:53:26

control-panel

π
rammelparty