M

Mr. Dubey • 52.30K Points
Coach 

Q. Consider the following Finite State Automaton The language accepted by this automaton is given by the regular expression

(A) b*ab*ab*ab
(B) (a+b)*
(C) b*a(a+b)*
(D) b*ab*ab
Correct : Option (C)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s) and the number of 1’s in s is denoted by n1(s). The language t

Q. How many memory locations are addressed using 18 address bits?

Q. The total participation by entities is represented in E-R diagram as

Q. Who developed the functional organization?

Q. What type of software testing is generally used in Software Maintenance?

Q. The basic building blocks of the arithmetic unit in a digital computers are

Q. ------------- This type of model exhibits are pair of relationship such as activity time or cost quantity.

Q. In the case of nested subroutines, the stack top is always

Q. According to the time estimates made by the PERT planners, the maximum time that would be needed to complete an activity is called as

Q. For the model, the security boundary may be defined for the vendor to include the software framework and middleware layer.