Automata Season - 3

Hi,

Today let me post on the expected question kinds from Automata in NET exam.

Expected Questions on Automata:

1. Questions related to grammar types

   Say: type 2 grammar is called what? – CFG 

2. Questions like true or false on certain statements on theories

  Say: (i) Union of 2 regular sets is regular. (ii) Intersection of 2 regular sets is regular – Both (i) and (ii) are true.

3. Questions on regular expressions

  Say: Two regular expressions will be given with an equal symbol (LHS = RHS). We have to either select the equivalent form or guess whether it is true or false, or pick out the right / wrong pair. Give a string and find out its regular expression.

4. Questions on Grammar

 Say: Give a set of strings and find the grammar or give grammar and find its equivalent. Give derivations and find grammar. Something of this sort has been repeated in 2012 June and December.

5. Questions in Match form

 Say: grammar connected with automata model. Model connected to ones who found it. Properties linked to grammar types. 4 matching terms may be given on both sides and options will be supposedly 1 correct match and 3 mismatch options.

6.  Apart from theory parts, some workings like questions (3) and (4) can also be asked in turing machines, finite automata, push down automata and pumping lemma.

With this, i am winding up Automata session..

Very soon, let me post something related to NET exam again..