Question: The minimum length of a string {0,1}* not in the language corresponding to the given regular expression:^ (0*+1*)(0*+1*)(0*+1*)
Options
A : 3
B : 4
C : 5
D : 6
Click to view Correct Answer
Regular Language & Expression - 1 more questions
Which of the following options is incorrect?
Consider following regular expression^ i) (a/b)* ii) (a*/b*)* iii) ((?/a)b*)*^....
Statement: If we take the union of two identical expression,....
The given regular language corresponds to which of the given....
The minimum number of 1's to be used in a....
Which of the following pair of regular expression are not....
Which of the following regular expression is equivalent to R(1,0)?^....
Ambiguous Grammar more Online Exam Quiz
Finding Patterns in Text,Algebric Laws and Derivatives
From Grammars to Push Down Automata
Node-Cover Problem, Hamilton Circuit Problem
Problem Solvable in Polynomial Time
Properties-Non Regular Languages
Turing Machine-Notation and Transition Diagrams
Engine Components - Connecting Rod