ATCD Quiz1

Length of the string ϵ is

• 0

• 1

• 2

• 3

According to the precedence rules, x-y-z is equivalent to which of the following?

• (x-y)-z

• x-(y-z)

• Both (x-y)-z and x-(y-z)

• None of the above

The number of elements in the set for the Language L = { x ϵ ∑* : length of x is at most 2} and ∑={0,1} is

• 7

• 6

• 8

• 5

Which of the following will not be accepted by the following DFA?

• abbbaa

• abbbaabb

• ababaabaa

• abbaabbaa

The following DFA accepts all those strings in which numbers of 1's and 0's are

• Odd and Even respectively

• Divisible by 3 and 2 respectively

• Even and Odd respectively

• Divisible by 2 and 3 respectively

What should be the accepting state(s) in order to accept 1*00?

• {Y}

• {Z}

• Any one of Y and Z can be accepting state

• {X,Y}

Which of the following is false?

• (01)*0=0(10)*

• (0+1)*01(0+1)*+1*0*=(0+1)*

• (0+1)*0(0+1)*1(0+1)*=(0+1)*01(0+1)*

• (0+1)*=0*+1*

How many strings of length exactly three does the language described by the regular expression (0+1)*0(0+1)* contains?

• 5

• 7

• 8

• 6

Which of the following Automation allows transformation to a new state without receiving any output signal?

• DFA

• NFA

• ϵ- NFA

• All of the above

ϵ- closure of a node can be empty. The above statement is True /False

• True

• False