Regular Language & Expression - 1 Online Exam Quiz
Regular Language & Expression - 1 GK Quiz. Question and Answers related to Regular Language & Expression - 1. MCQ (Multiple Choice Questions with answers about Regular Language & Expression - 1
(a+b)* is equivalent to
Options
A : b*a*
B : (a*b*)*
C : a*b*
D : none of the mentioned
Consider following regular expression^ i) (a/b)* ii) (a*/b*)* iii) ((?/a)b*)*^ Which of the following statements is correct
Options
A : i,ii are equal and ii,iii are not
B : i,ii are equal and i,iii are not
C : ii,iii are equal and i,ii are not
D : all are equal
Statement: If we take the union of two identical expression, we can replace them by one copy of the expression.^ Which of the following is a correct option for the given statement?
Options
A : Absorption Law
B : Idempotent Law
C : Closure Law
D : Commutative Law
The given regular language corresponds to which of the given regular language^ e+1+(1+0)*0+(0+1)*11
Options
A : The language of all strings that end with 11 or 00
B : The language of all strings that end with 0 or 1
C : The language of all strings which does not end with 01
D : None of the mentioned
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
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
Which of the following pair of regular expression are not equivalent?
Options
A : 1(01)* and (10)*1
B : x(xx)* and (xx)*x
C : (ab)* and a*b*
D : x+ and x*x+
Which of the following regular expression is equivalent to R(1,0)?^ R(1,0)={111*}*
Options
A : (11+111)*
B : (111+1111)*
C : (111+11*)*
D : All of the mentioned
?L is equivalent to
Options
A : ?
B : ?
C : L
D : L?
?L is equivalent to
Options
A : L?
B : ?
C : L
D : ?
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