Solved

Consider a Stack, Which Is Limited to 10 Items

Question 6

Multiple Choice

Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as

A) Regular
B) Deterministic context free
C) Context free
D) Recursive

Related Questions

Q1: Which statement is true?<br>A)The tape of turing

Q2: In FA, if one enters in a

Q3: The symbols that can't be replaced by

Q4: Let n be the positive integer constant

Q5: Which of the following statement is false

Q7: Which of the following will be used

Q8: State table of an FSM is given

Q9: Which of the following instances of the

Q10: Left hand side of a production in

Q11: Consider a graph G = (V, E)