#### From the options given below, the pair having different expressive power is

Correct!
Wrong!

#### The language which is generated by the grammar S-> aSa I bSb I a I b over the alphabet {a, b} is the set of

Correct!
Wrong!

#### For the language {ap I P is a prime}, the statement which hold true is

Correct!
Wrong!

#### The language described by the regular expression (0+1)*0(0+1)*0(0+1)* over the alphabet {0 1} is the set of

Correct!
Wrong!

#### Consider a stack, which is limited to 10 items. The language accepted by a push- down automaton in such stack is best described as

Correct!
Wrong!

#### Which one of the following statement is true if L denotes the language generated by the grammar S->0S0/00?

Correct!
Wrong!

#### We have two statements S1 and S2 whose definition are as follows: S1 – {02n In ≥ I} is a regular language. S2 – {0m 1n 0 1m+n Im=1 and n≥1I is a regular language. Which one of the following statements is correct?

Correct!
Wrong!

#### S -> a α b I b a c I ab S -> α S I b S -> α bb I ab S -> bdb I b The grammar described above is

Correct!
Wrong!

#### Which one of the following is applicable for context free languages?

Correct!
Wrong!

#### Which one of the following is true regarding FOTRAN?

Correct!
Wrong!

#### Let S and T be language over ={a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is true?

Correct!
Wrong!

#### Which of the following statements in true?

Correct!
Wrong!

#### If L is DFA-regular, L’ is

Correct!
Wrong!

#### Which of the following options is incorrect?

Correct!
Wrong!

#### All the regular languages can have one or more of the following descriptions: i) DFA ii) NFA iii) e-NFA iv) Regular Expressions Which of the following are correct?

Correct!
Wrong!

#### The major difference between a moore and mealy machine is that

Correct!
Wrong!

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

Correct!
Wrong!

#### If S be an infinite set and be sets such that S1 ∪ S2 ∪ .....∪ Sn = S, then

Correct!
Wrong!

#### If ∑ = {a, b, c, d, e, f } then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is

Correct!
Wrong!

#### An automation is a __________ device and a grammar is a __________ device.

Correct!
Wrong!