Question
X0 = 1 X1
X1 = 0 X1 + 1 X2
X2 = 0 X1 + {λ}
Which one of the following represents the strings in X0?
a.
10 (0* + (10)*)1
b.
10 (0* + (10)*)*1
c.
10 (0* + (10)*)*1
d.
10 (0 + 10)*1 + 110 (0 + 10)*1
Posted under Formal Languages and Automata Theory
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X0.How are X1 and X2 are related ? X0 = 1 X1 X1 = 0 X1 + 1 X2 X2 = 0 X1 + {λ} Which...
Similar Questions
Discover Related MCQs
Q. Which of the following pairs of regular expression are equivalent?
View solution
Q. Which of the following identity is true?
View solution
Q. The set of all strings over ∑ = {a,b} in which all strings having bbbb as substring is
View solution
Q. The set of all strings over ∑ ={a,b} in which a single a is followed by any number of b’s a single b followed by any number of a’s is
View solution
Q. Regular expressions are used to represent which language
View solution
Q. The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is
View solution
Q. If P, Q, R are three regular expressions and if P does not contain a then the equation R = R + RP has a unique solution given by
View solution
Q. Which of the following regular expression denotes zero or more instances of an a or b?
View solution
Q. The string (a)|((b)*(c)) is equivalent to
View solution
Q. How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)* ?
View solution
Q. Which of the following is true ?
View solution
Q. Let the class of language accepted by finite state machine be L1 and the class of languages represented by regular expressions be L2 then
View solution
Q. Which of the following is not a regular expression?
View solution
Q. Regular expression are
View solution
Q. Regular expressions are closed under
View solution
Q. Regular expression (x/y)(x/y) denotes the set
View solution
Q. Which of the following is same as the given DFA?
View solution
Q. Which of the given regular expressions correspond to the automata shown?
View solution
Q. Can the given state diagram be reduced?
View solution
Q. L is a regular Language if and only If the set of __________ classes of L is finite.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Formal Languages and Automata Theory? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
