Classical

Theory Of Computation MCQ - Regular languages and finite automata

56:  

 If two finite states machine M and N are isomorphic, then

A.

M can be transformed to N, merely re-labelling its states

B.

M can be transformed to N, merely re-labelling its edges

C.

M can be transformed to N, merely re-labelling its edges

D.

none of these

 
 

Option: A

Explanation :

Click on Discuss to view users comments.

Write your comments here:



57:  

 Regular expression corresponding to the state diagram given in the figure isregular-expression

A.

(0+1(1 + 01)* 00)*

B.

(1 + 0 (0 + 10) 00)*

C.

(0 + 1 (1 + 10) 00)*

D.

(1 + 0(1 + 00) 11)*

 
 

Option: A

Explanation :

Click on Discuss to view users comments.

Write your comments here:



58:  

Two finite state machines are said to be equivalent if they

A.

have same number of states

B.

have same number of edges

C.

have same number of states and edges

D.

recognize same set of tokens

 
 

Option: C

Explanation :

Click on Discuss to view users comments.

Jugraj said: (12:11pm on Sunday 28th April 2013)
i think answer should be D not C because two FSM are equivalent if they accept same set of strings
mmam said: (6:30am on Saturday 18th May 2013)
yes ,Jugraj answer is very correct

Write your comments here:







Suggest an improvement