InterviewSolution
Saved Bookmarks
| 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 |
|