Machine-translated by Google. Questions are authored in English.
Top

Discussion

The subset construction converts

  • A.a deterministic automaton into an equivalent regular expression
  • B.a context free grammar into an equivalent regular definition
  • C.a nondeterministic finite automaton into an equivalent deterministic one
  • D.a regular expression directly into the minimal deterministic automaton

Answer: C

Each state of the resulting DFA is a set of NFA states. The construction is what allows a scanner to run in time linear in the input despite the nondeterminism of the original automaton. The cost is paid once when the scanner is generated rather than on every input.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.