Poznámky
Osnova
Part X.
Normal Forms and Properties of CFLs
Chomsky Normal Form (CNF)
Greibach Normal Form (GNF)
Generative Power of Normal Forms
General Parsing Methods
GP Based on Chomsky Normal Form
Algorithm: GP Based on CNF
GP Based on CNF: Example 1/5
GP Based on CNF: Example 2/5
GP Based on CNF: Example 3/5
GP Based on CNF: Example 4/5
GP Based on CNF: Example 5/5
Pumping Lemma for CFL
Pumping Lemma: Illustration
Pumping Lemma: Application
Pumping Lemma: Example 1/2
Pumping Lemma: Example 2/2
Closure properties of CFL
Algorithm: CFG for Union
Algorithm: CFG for Concatenation
Algorithm: CFG for Iteration
Closure properties
Intersection: Not Closed
Complement: Not Closed
Main Decidable Problems
Algorithm: Membership
Accessible Symbols
Terminating Symbols
Algorithm: Emptiness
Algorithm: Finiteness
Main Undecidable Problems