McqMate

Q. |
## Which of the following denotes Chomskianhiearchy? |

A. | REG ⊂ CFL ⊂ CSL ⊂ type0 |

B. | CFL ⊂ REG ⊂ type0 ⊂ CSL |

C. | CSL ⊂ type0 ⊂ REG ⊂ CFL |

D. | CSL ⊂ CFL ⊂ REG ⊂ type0 |

Answer» A. REG ⊂ CFL ⊂ CSL ⊂ type0 |

598

0

Do you find this helpful?

1

View all MCQs in

Theory of ComputationNo comments yet

- Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?
- The regular expression 0*(10)* denotes the same set as
- Regular expression (x/y)(x/y) denotes the set
- Which of the following strings is not generated by the following grammar? S → SaSbS ε
- Consider the following problem x. Given a Turing machine M over the input alphabet Σ, any state q of M. And a word w Є Σ*, does the computation of M on w visit the state q? Which of the following statements about x is correct?
- Consider the following CFG S → aB S → bA**spaceB → b A → a**spaceB → bS A → aS**spaceB → aBB A → bAA**space Consider the following derivation **spaceS ⇒aB**space⇒aaBB**space⇒aaBb**space⇒aabSb**space⇒aabbAb**space⇒aabbab**space This derivation is
- 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 statement is wrong?
- Given S = {a, b}, which one of the following sets is not countable?
- In which of the stated below is the following statement true? “For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.”