Question: The minimum number of 1's to be used in a regular expression of the given language:^ R(x): The language of all strings containing exactly 2 zeroes.
Options
A : 2
B : 3
C : 0
D : 1
Regular Language & Expression - 1 more questions
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 length of a string {0,1}* not in the....
Which of the following pair of regular expression are not....
Which of the following regular expression is equivalent to R(1,0)?^....
All the regular languages can have one or more of....
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