Classical

Theory Of Computation MCQ - Regular languages and finite automata

51:  

 If w ∈  (a, b)* satisfy abw = wab, then (w) is

A.

even

B.

odd 

C.

null

D.

none of these

 
 

Option: A

Explanation :


52:  

 A PDM behaves like an FSM wnen the number of auxiliary memory it has, is

A.

0

B.

1

C.

2

D.

none of these

 
 

Option: A

Explanation :


53:  

A finite state machine with the following state table has a single input x and a single output z

 

 

Present state

Next state, z

 

       x = 1

      x = 0

A

     D, 0

     B, 0

B

      B,1

      C,1

C

      B, 0

     D, 1

D

      B, 1

     C, 0

 

             
               If the initial state is unknown, then shortest input sequence to reach the final state C is
A.

01

B.

10

C.

10

D.

110

 
 

Option: B

Explanation :


54:  

 FSM shown in the figure fsm

A.

all strings

B.

no string

C.

 ε- alone

D.

none of these

 
 

Option: C

Explanation :


55:  

If f : {a, b}* ---> {a , b } * be given by f(n) = ax for every value of n ∈ {a, b}, then f is

A.

one to one not onto

B.

one to one and onto

C.

not one to one and not onto

D.

not one to one and onto

 
 

Option: A

Explanation :




Suggest an improvement