720 likes | 929 Views
Erik Jonsson School of Engineering and Computer Science. CS 4384 – 0 01. Automata Theory. http://www.utdallas.edu/~pervin. Thursday: Context-Free Languages Chapter Three. Tuesday 3-18-14. FEARLESS Engineering. Context-free Languages. Chapter Three. Palindromes. Chomsky Normal Form.
E N D
Erik Jonsson School of Engineering and Computer Science CS 4384– 001 Automata Theory http://www.utdallas.edu/~pervin Thursday: Context-Free Languages Chapter Three Tuesday3-18-14 FEARLESS Engineering
Context-free Languages Chapter Three
Other Simplifications Useful variables and productions Left-recursion
Left-recursion 3-04-14
Pushdown Automata Many similar definitions
What if the input does not have a middle separator so we do not know when to start the comparison between the input and the stack? Non-determinism!
S -> aSb | ab => S -> X_aY | X_aX_b ; Y -> SX_b; X_a -> a ; X_b -> b
PUMPING LEMMA Context-Free 3-6-14
NOTE: CFLs are not closed under intersection (or complement)!