chap5
NLP (Fall 2013): Recursive & Augmented Transition Networks
1 Context-Free Languages Not all languages are regular. L 1 = {a n b n | n 0} is not regular. L 2 = {(), (()), ((())),...} is not regular. some properties.
Context-Free Languages
