Скачать или смотреть [UR] Theory of Automata Sessional-II Prep Guide, Fall 2025 FAST NUCES LHR

Everything FAST-NUCES LHR Related I've Put Out:
https://docs.google.com/document/d/1e...
0:00 - Syllabus

Timestamps:
1:02 - Context Free Grammars
4:55 - This one should've had bYc instead of bYd
9:44 - Union of two CFGs

10:15 - Left-Most vs Right-Most Derivation
12:25 - Ambiguous Grammars
14:25 - Ambiguous Grammars vs Ambiguous Languages
15:55 - All Regular Languages can Be Written as an Unambiguous CFG
16:25 - FA to CFG Conversion and Viceversa
18:57 - Removing Ambiguity from a Grammar where Disturbing Strings Form a Pattern

25:43 - Total Language Tree

26:22 - Chomsky Normal Form
27:28 - Removing Null Productions
30:41 - We End Up Losing the Empty Word
31:16 - Removing Unit Productions
32:07 - Defining More Non-Terminals and Grouping
33:30 - Why CNF?

33:54 - CYK Algorithm Purpose
35:15 - CYK Algorithm Tabulation Notations
36:12 - CYK Algorithm Example Problem
36:37 - Populating Row 1
37:40 - Populating Row 2
42:10 - Populating Row 3
47:06 - Handling Nulls
48:08 - Populating Row 4
50:47 - Fast Population Method
53:11 - Interpreting Resulting Table

54:22 - 7-Tuple Definition of PDA
55:15 - Understanding the Transition Function
58:11 - Important Differences in Notation
1:01:20 - DPDA for a^n b^n in Martin's Notation
1:06:48 - DPDA for a^n b^n in Cohen's (Flowchart) Notation
1:07:39 - NPDAs vs DPDAs
1:09:15 - NPDA for Palindromes in Cohen's (Flowchart) Notation
1:10:17 - Union of two PDAs
1:11:10 - Core Logic for Constructing PDAs for Important CFLs
1:14:17 - A Few Harder Languages
1:17:21 - CFG to PDA Conversion
1:19:29 - Trace Table for a String

1:20:59 - End