How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.43K Points
Coach

Q.) How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

(A) 7

(B) 10

(C) 12

(D) 11

Correct answer : Option (D) - 11

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Decentralised IT management system has

Q. In a real problem, you should check to see if the SVM is separable and then include slack variables if it is not separable.

Q. Identify the correct example of Nominal Attributes.

Q. System engineering deals with

Q. What is a trigger pulse?

Q. What does command LS do

Q. Each tablespace in an Oracle database consists of one or more ﬁles called

Q. Which is an example for block special file?

Q. Detailed design stage include which of the following activity?

Q. Which of the following is a process that involves managers from all parts of the organization in the formulation of strategic goals?