Non-Deterministic Finite Automata MCQ

Test your knowledge with important Non-Deterministic Finite Automata MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Non-Deterministic Finite Automata MCQs at Bissoy

• Like DFAs, NFAs only recognize regular languages.
  ক

  True

  খ

  False
• For every NFA a deterministic finite automaton (DFA) can be found that accepts the same language.
  ক

  True

  খ

  False
• Which is the application of NFA?
  ক

  A regular language is produced by union of two regular languages

  খ

  The concatenation of two regular languages is regular

  গ

  The Kleene closure of a regular language is regular

  ঘ

  All of the mentioned
• The subset construction shows that every NFA accepts a __________
  ক

  String

  খ

  Function

  গ

  Regular language

  ঘ

  Context-free language
• An NFA may be converted to a DFA using __________
  ক

  Induction

  খ

  A construction

  গ

  Contradiction

  ঘ

  Compilation
• A regular language corresponds to __________
  ক

  An alphabet

  খ

  Set of strings over an alphabet

  গ

  A DFA only

  ঘ

  A DFA or an NFA
• Conversion of a DFA to an NFA __________
  ক

  Is impossible

  খ

  Requires the subset construction

  গ

  Is Chancy

  ঘ

  Is nondeterministic
• An NFA’s transition function returns ________
  ক

  A Boolean value

  খ

  A state

  গ

  A set of states

  ঘ

  An edge
• NFAs are ________ DFAs.
  ক

  Larger than

  খ

  More expressive than

  গ

  Less expressive than

  ঘ

  Equally expressive as
• The Tuples for NDFA is ___________
  ক

  ∑, Q, q0, F, δ

  খ

  Q, q0, F, δ

  গ

  Θ, Q, q0, F,δ

  ঘ

  F, Q, Δ, q0, δ
• The regular languages are not closed under ___________
  ক

  Concatenation

  খ

  Union

  গ

  Kleene star

  ঘ

  Complement
• NDFAs where introduced by ____________
  ক

  Michael O Rabin & Dana Scott

  খ

  Dan Brown

  গ

  Sun micro system Labs

  ঘ

  SAP Labs