Theory of Automata (CS402)
Assignment # 6
Question No. 1:
S→ aSSb | aab
S→ SSS | a | b
Construct a Push Down Automaton (PDA) for above Context Free Grammar (CFG) without conversion into Chomsky Normal Form (CNF).
Marks [10]
Question No. 2:
Convert the following Push Down Automaton (PDA) in to conversion form:
 Assignment # 6 Question No. 1: ...){kind=link}
0 comments
Post a Comment