Click to Get updated NTA UGC NET CS Test Series           Study Material for UGC NET Computer Science- 2019

# 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 Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:
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 Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:
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 Answer Report Discuss Option: B Explanation : Click on Discuss to view users comments. Write your comments here:
54:

FSM shown in the figure

 A. all strings B. no string C. ε- alone D. none of these Answer Report Discuss Option: C Explanation : Click on Discuss to view users comments. Write your comments here:
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 Answer Report Discuss Option: A Explanation : Click on Discuss to view users comments. Write your comments here:

X