Multiple choice

The recognizing capabilities of NDFSM and DFSM where NDFSM - non deterministic finite state machine and DFSM - deterministic finite state machine

  1. may be different

  2. must be different

  3. must be same

  4. none of these
Reveal answer Fill a bubble to check yourself
C Correct answer
Explanation

Non-deterministic finite state machines (NDFSM) and deterministic finite state machines (DFSM) are equivalent in terms of the class of languages they can recognize, which is the class of regular languages.

Keep practicing — related questions