The given automata will accept .........................a)even number of 0's and odd number of 1's.b)odd number of 0's and odd number of 1's.c)odd number of 0's and even number of 1's.d)even number of 0's and even number of 1's.

even number of 0's and odd number of 1's.b)odd number of 0's and odd number of 1's.c)odd number of 0's and even number of 1's.d)even number of 0's and even number of 1's.

how many number of states do we require for evaluating a string which has odd count of 0's odd count of 1's even count of 2'sa.14b.16c.4d.8

onvert the following regular expression into Non-Deterministic Finite Automata (NFAs), show all the steps.(a) (0 + 1)*000(0 + 1)*(b) (((00)*(11))+ 01)*

Identify the string set for the Σ {0,1} even count of zeros and odd count of onesa.{001,100,01,0000111,10101,0011}b.{0101,1010,1001,01000111,101001}c.{ε,001,100,0000111,101101}d.{111,001,100,0011100,0000111,10101}

Which language accepted by the regular expression (0+1)*0(0+1)*0(0+1)*.Select one:a. The set of all strings containing at least two 0’s.b. The set of all strings that begin and end with either 0 or 1.c. The set of all strings containing at most two 0’s.d. The set of all strings containing the substring 00.