Any given transition graph has an equivalent:
A)regular
B)DFSM (Deterministic Finite State Machine)
C)NDFSM
D)All of them

Name: Any given transition graph has an equivalent: A)regular B)DFSM (Deterministic Finite State Machine) C)NDFSM D)All of them
Brand: Quizplus
Rating: 4.9 (37 reviews)

Question

Quizplus · Accepted Answer

Any given transition graph can be represented as a regular expression, a Deterministic Finite State Machine (DFSM), or a Nondeterministic Finite State Machine (NDFSM), making all of them equivalent representations.

Any Given Transition Graph Has an Equivalent