WBUT 2012: Formal Language and Automata Theory (Paper Code: CS-402)

 

CS/B.TECH(CSE/IT)NEW/SEM-4/CS-402/2012

2012

FORMAL LANGUAGE & AUTOMATA THEORY

Time Allotted : 3 Hours                                              Full Marks : 70

The figures in the margin indicate full marks.

Candidates are required to give their answers in their own words

as far as practicable.

GROUP – A

(Multiple Choice Type Question)

1.       Choose the correct alternatives for the following:     10 x 1 = 10

          i)       The basic limitation of FSM is that

                   a)      it cannot remember arbitrary large amount of information
                   b)      it sometimes recognize grammar that is not regular
                   c)      it sometimes fails to recognize grammar that is regular
                  d)      all of these.

          ii)      Choose the correct statements:

                   a)      Moore & Mealy machine are FSM with output capabilities

                   b)      Any given Moore machine has an equivalent Mealy machine

                   c)      Any given Mealy machine has an equivalent Moore machine

                   d)      Moore machine is not an FSM.