CS402 GDB Solution Spring 2012

Context Free Grammar (CFG) and Push Down Automata (PDA) are used for representing both regular and non-regular languages. Keeping in view the structure and flexibilities provided by both the methods, which approach will you prefer for representing non-regular languages? Justify your answer with logical reasons in either case

Solution: Coming Soon

DOWNLOAD SOLUTION HERE
loading...