|
1
|
|
|
|
PDA Example (a^n b^2n)
|
|
|
3 listeners
|
|
2
|
|
|
|
Context Free Languages Lecture Series - 01a Pushdown Automata
|
|
|
2 listeners
|
|
3
|
|
|
|
Context Free Languages Lecture Series - 01c - More Examples of PDA
|
|
|
2 listeners
|
|
4
|
|
|
|
Conversion of CFG to PDA
|
|
|
2 listeners
|
|
5
|
|
|
|
Regular Expression
|
|
|
2 listeners
|
|
6
|
|
|
|
Context Free Languages Lecture Series - 03a Chomsky Normal Form
|
|
|
1 listener
|
|
7
|
|
|
|
Context Free Languages Lecture Series - 01b - Formal Definition of PDA
|
|
|
1 listener
|
|
8
|
|
|
|
Context Free Languages Lecture Series - 03c CYK Algorithm
|
|
|
1 listener
|
|
9
|
|
|
|
Regular Languages Lecture Series - 03a - FSA to Regex Conversion - Part 1
|
|
|
1 listener
|
|
10
|
|
|
|
Regular Languages Lecture Series - 03b - FSA to Regex Conversion - Part 2
|
|
|
1 listener
|
|
11
|
|
|
|
Regular Languages Lecture Series - 04 - Regex to λ-NFA Conversion
|
|
|
1 listener
|
|
12
|
|
|
|
Regular Languages Lecture Series - 05 - λ-NFA to DFA Conversion
|
|
|
1 listener
|
|
13
|
|
|
|
Context Free Languages Lecture Series - 03d Greibach Parsing Algorithm
|
|
|
1 listener
|
|
14
|
|
|
|
PDA Example (a^n b^m c^n)
|
|
|
1 listener
|
|
15
|
|
|
|
LECTURE-#27- Acceptance of a PDA by Final State and Empty Stack
|
|
|
1 listener
|
|
16
|
|
|
|
Inductive Proof
|
|
|
1 listener
|
|
17
|
|
|
|
Pumping Lemma for Regular Languages
|
|
|
1 listener
|
|
18
|
|
|
|
Inductive Proof Example
|
|
|
1 listener
|
|
19
|
|
|
|
Example
|
|
|
1 listener
|
|
20
|
|
|
|
Basic Definitions in Automata Theory
|
|
|
1 listener
|
|
21
|
|
|
|
NFA to DFA conversion Example
|
|
|
1 listener
|
|
22
|
|
|
|
PDA Example (a^n b^m c^m d^n)
|
|
|
1 listener
|
|
23
|
|
|
|
Epsilon Closure
|
|
|
1 listener
|
|
24
|
|
|
|
Automata-based Constraints for Language Model Decoding
|
|
|
1 listener
|
|
25
|
|
|
|
Introduction
|
|
|
1 listener
|
|
26
|
|
|
|
Instantaneous Description
|
|
|
1 listener
|
|
27
|
|
|
|
NPDA Example (w w^r)
|
|
|
1 listener
|
|
28
|
|
|
|
DPDA Example (wcw^r)
|
|
|
1 listener
|
|
29
|
|
|
|
PDA Introduction with Example (0^n 1^n)
|
|
|
1 listener
|
|
30
|
|
|
|
Context Free Languages Lecture Series - 03b Greibach Normal Form
|
|
|
1 listener
|
|
31
|
|
|
|
Conversion of PDA to CFG
|
|
|
1 listener
|
|
32
|
|
|
|
Code for Turing Machine
|
|
|
1 listener
|
|
33
|
|
|
|
Post’s Correspondence Problem (PCP)
|
|
|
1 listener
|
|
34
|
|
|
|
Modified Post Correspondence Problem (MPCP)
|
|
|
1 listener
|
|
35
|
|
|
|
MPCP to PCP Conversion
|
|
|
1 listener
|
|
36
|
|
|
|
Turing Machine to MPCP Conversion
|
|
|
1 listener
|
|
37
|
|
|
|
Deductive Proof
|
|
|
1 listener
|
