Question
a.
1(01)* and (10)*1
b.
x(xx)* and (xx)*x
c.
(ab)* and a*b*
d.
x+ and x*x+
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. Which of the following pair of regular expression are not equivalent?
Similar Questions
Discover Related MCQs
Q. Consider following regular expression
i) (a/b)*
ii) (a*/b*)*
iii) ((ϵ/a)b*)*
Which of the following statements is correct
View solution
Q. What kind of expressions do we used for pattern matching?
View solution
Q. Which of the following do Regexps do not find their use in?
View solution
Q. Which of the following languages have built in regexps support?
View solution
Q. The following is/are an approach to process a regexp:
View solution
Q. Are the given two patterns equivalent?
(1) gray|grey
(2) gr(a|e)y
View solution
Q. Which of the following are not quantifiers?
View solution
Q. Which of the following cannot be used to decide whether and how a given regexp matches a string:
View solution
Q. Conversion of a regular expression into its corresponding NFA :
View solution
Q. Which among the following is not a UNIX command for regular expressions?
View solution
Q. What is the significance of $ used in regular expression in UNIX?
View solution
Q. Generate the regular expression to match blank lines
View solution
Q. For the given syntax of sed, which among the following is not a correct option?
General syntax of sed: /pattern/action
View solution
Q. What does grep do in UNIX?
View solution
Q. State true or false:
Statement: A regular expression is a sequence of characters that represent a pattern.
View solution
Q. Which of the following options support the given statement?
Statement: A regular expression could be a fixed word or describe something like more general.
View solution
Q. What does the following segment of code does?
grep -i man heroes.txt
View solution
Q. What does “X?” do regular expression operator?
View solution
Q. Which of the following does not support regular expressions?
View solution
Q. Lexemes can be referred to as:
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!