Question
L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
a.
(0+01)*
b.
(0+01)*1
c.
(0+01)*(1+01)
d.
All of the mentioned
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. Generate a regular expression for the given language:l L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
Similar Questions
Discover Related MCQs
Q. The minimum number of transitions to pass to reach the final state as per the following regular expression is:
{a,b}*{baaa}
View solution
Q. Which of the following is an utility of state elimination phenomenon?
View solution
Q. If we have more than one accepting states or an accepting state with an outdegree, which of the following actions will be taken?
View solution
Q. Which of the following is not a step in elimination of states procedure?
View solution
Q. Which of the following methods is suitable for conversion of DFA to RE?
View solution
Q. State true or false:
Statement: The state removal approach identifies patterns within the graph and removes state, building up regular expressions along each transition.
View solution
Q. The behaviour of NFA can be simulated using DFA.
View solution
Q. It is suitable to use ____________ method/methods to convert a DFA to regular expression.
View solution
Q. State true or false:
Statement: For every removed state, there is a regular expression produced.
View solution
Q. Is it possible to obtain more than one regular expression from a given DFA using the state elimination method?
View solution
Q. A regular language over an alphabet a is one that can be obtained from
View solution
Q. Regular expression {0,1} is equivalent to
View solution
Q. Precedence of regular expression in decreasing order is
View solution
Q. Regular expression Φ* is equivalent to
View solution
Q. a? is equivalent to
View solution
Q. ϵL is equivalent to
View solution
Q. (a+b)* is equivalent to
View solution
Q. ΦL is equivalent to
View solution
Q. Which of the following pair of regular expression are not equivalent?
View solution
Q. Consider following regular expression
i) (a/b)*
ii) (a*/b*)*
iii) ((ϵ/a)b*)*
Which of the following statements is correct
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!
