Classical

Theory Of Computation MCQ - Regular languages and finite automata

21:  

 The major difference between a moore and mealy machine is that

A.

 output of the former depends on the present state and present input

B.

output of the former depends only on the present state

C.

output of former depends only on the present input

D.

all of these

 
 

Option: B

Explanation :


22:  

 Any given transition graph has an equivalent

 
A.

 regular expression

B.

DFSM 

 
C.

NDFSM

 
D.

all of these

 
 

Option: D

Explanation :


23:  

For which of the following application, regular expressions cannot be used ?

A.

Designing computers

B.

Designing compilers

C.
Both (a) and (b)
 
D.

Developing computers

 
 

Option: D

Explanation :


24:  

If S be an infinite set and be sets such that S∪ S∪  .....∪ S= S, then

A.

atleast one of the set Si is a finite set

 

 

B.

not more than one of the sets Scan be finite

C.

atleast one of the sets Si is an infinite set

 
D.

not more than one of the sets Si can be infinite

 
 

Option: C

Explanation :


25:  

Vienna Definition Language is an example of language definition facility based on 

A.

Mathematical semantics 

 
B.

Interpretative semantics 

 
C.

Translational semantics 

 
D.

Axiomatic semantics

 
 

Option: A

Explanation :




Suggest an improvement