edited by
8,107 views

1 Answer

Best answer
50 votes
50 votes

Correct Option: B

With only finite positions in stack, we can have only finite configurations and these can also be modeled as states in a finite automata.

edited by
Answer:

Related questions

39 votes
39 votes
8 answers
2
Kathleen asked Sep 15, 2014
17,671 views
The maximum number of edges in a $n$-node undirected graph without self loops is$n^2$$\frac{n(n-1)}{2}$$n-1$$\frac{(n+1)(n)}{2}$
32 votes
32 votes
5 answers
3
Kathleen asked Sep 15, 2014
13,676 views
In the absolute addressing mode:the operand is inside the instructionthe address of the operand in inside the instructionthe register containing the address of the operan...
21 votes
21 votes
1 answer
4
Kathleen asked Sep 15, 2014
8,016 views
The optimal page replacement algorithm will select the page thatHas not been used for the longest time in the pastWill not be used for the longest time in the futureHas b...