aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Test 2 - Theory of Computation | Computer Science(CS)
  • Which one of the following is FALSE?
Multiple choice

Which one of the following is FALSE?

  1. There is unique minimal DFA for every regular language

  2. Every NFA can be converted to an equivalent PDA.

  3. Complement of every context-free language is recursive.

  4. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions

  • Which of the following statements is false?
  • Which of the following statements is false?
  • Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
  • Let L1 be a regular language, L2 be a deterministic context-free language and L3 a recursively enumerable, ...
  • Consider the DFA given below. ![](https://i.imgur.com/3VcxXPZ.png) Which of the following are FALSE? 1. Com...
  • A deterministic finite automation DFAD with alphabet $\sum$ is given below: ![](https://i.imgur.com/PIneOHT...
  • Given an arbitary non-deterministic finite automaton (NFA) with N states, the maximum number of states in a...
  • Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exist...
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy