Graded Discussion Board (GDB) Topic
All students of CS402 are directed to participate in the GDB that will be opened from February 14, 2013 to February 15, 2013.
GDB answer via email or through MDB will not be accepted.
Note: Your answer should not be greater than 200 words.
Topic:
Deterministic and non-deterministic Push Down Automata (PDA) are used for representing both regular and Context Free Languages (CFL). Keeping in view the characteristics of both approaches, which one will you prefer for representing languages.
Justify your answer with logical reasons in either case.
0 comments
Post a Comment