McqMate

Q. |
## The language accepted by a Push down Automata: |

A. | Type0 |

B. | Type1 |

C. | Type2 |

D. | Type3 |

Answer» C. Type2 |

2.7k

0

Do you find this helpful?

42

View all MCQs in

Theory of ComputationNo comments yet

- Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is regular. 3) Whether two push down automata accept the same language. 4) Whether a given grammar is context free.
- The language accepted by a Push down Automata:
- Match all items in Group 1 with correct options from those given in Group 2. List I List II**spaceP. Regular Expression 1. Syntax analysis**spaceQ. Push down automata 2. Code Generation**spaceR. Dataflow analysis 3. Lexical analysis**spaceS. Register allocation 4. Code optimization
- Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as
- Fred created a new automaton model which is a push down automaton but with two stacks and the added ability of having commands which do not read input tape but which can pop from one stack and push into the other.This new automaton can recognize (choose strongest result)
- Which of the following is true with respect to Kleene’s theorem? 1 A regular language is accepted by a finite automaton. 2 Every language is accepted by a finite automaton or a turingmachine.
- Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained by changing the accepting state of M to a non-accepting state and by changing the non-accepting state of M to accepting states. Which of the following statements is true?
- A pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.
- Let P be a regular language and Q be context-free language such that Q ∈ P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn n∈ N}). Then which of the following is ALWAYS regular?
- A language L is accepted by a FSA iff it is