Question: 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
Regular Language & Expression - 1 more questions
Which of the following are related to tree automaton?
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 minimum length of a string {0,1}* not in the....
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