1.

How can a finite state machine be converted into a push down automata?(a) By including a push-down stack(b) By including a push-down stack with Push() function(c) By including a push-down stack with Pop() function(d) By including a push-down stack with Push() and Pop() functionI had been asked this question in an online quiz.This intriguing question originated from Software Architecture Tradeoffs topic in chapter Technology Tradeoffs in Software Defined Radio of Cognitive Radio

Answer»

Right option is (C) By including a push-down STACK with Pop() function

The EXPLANATION is: A finite state machine be converted into a push down automata by including a push-down stack with Push() and Pop() function. Push-down automata supports unlimited number of STATES. The availability of stack SPACE and time taken to reach certain states are challenges for push-down automata.



Discussion

No Comment Found

Related InterviewSolutions