Theory of Computation - Old Questions
14. Explain the following:
a)
Minimization of finite
state machine
b)
Push down automata (PDA).
c)
Halting problems
d)
Computational complexity
8 marks
|
Asked in 2069