Automata Theory

Which of the following does not represents the given language?

Language: {0,01}

• 0+01

• {0} U {01}

• {0} U {0}{1}

• {0} ^ {01}

Concatenation Operation refers to which of the following set operations:

• Union

• Dot

• Kleene

• None

Concatenation of R with Ф outputs

• R

• Ф

• R.Ф

• None

RR* can be expressed in which of the forms:

• R+

• R-

• R+ U R-

• R

The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3, where n is number of bits.

• 3

• 4

• 5

• 1

In Moore machine, output is produced over the change of:

• transitions

• states

• both of the above

• None

For a give Moore Machine, Given Input=’101’, thus the output would be of length

• 4

• 3

• 2

• none

The minimum number of states required to recognize an octal number divisible by 3 are/is

• 1

• 3

• 5

• 7

The sum of minimum and maximum number of final states for a DFA n states is equal to:

• n+1

• n

• n-1

• n+2

If NFA of 7 states is converted into DFA, maximum possible number of states for the DFA is ?

• 64

• 132

• 128

• 127