chap5
Dept. of Computer Science & IT, FUUAST Automata Theory 2 Automata Theory V Context-Free Grammars andLanguages.
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
