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

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