MadeEasy Workbook: Theory of Computation - Finite Automata

Question

Any given transition diagram has an equivalent

a) regular expression

b) NDFSM

c) DFSM

d) all of these

Comments

answer will be D) all of these when the given transition diagram is for regular languages,

But if the given transition is of CFL, CSL or Rec, Rel then there should be another option e) none of these should be true.

Answer 1

D) All Of these

Here from the options we can infer that they are talking about transition diagram w.r.t.  Regular Languages only.
So Transition diagram ,
So if Regular expression is possible than definitely DFA & NFA is possible.
Therefore 'D'

Answer 2

Question is saying about regular language bcz all these things have finite memory . so D is the answer.

Explanation 

  we have Theorem that if a language is regular then it must have a FA. 

DFA isalso a special type of NFA with no null move ,and no choice. and again for every FA we can write a regular expression. 

Comments

If they ask about NPDA DPDA  equivalent to transition diagram  that is true or not