info@avatto.com
+91-9920808017
51. If a language is denoted by a regular expression L = ( x )* (x | y x ) , then which of the following is not a legal string within L?
yx
xyx
x
x y x y x
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
52. If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called
decidable
undecidable
interpretive
non-deterministic
53. The defining language for developing a formalism in which language definitions can be stated, is called
syntactic meta language
decidable language
intermediate language
high level language
54. If L be set of strings from alphabet, then kleen closure of L is given as
55. If e1 and e2 are the regular expressions denoting the languages L1 and L2 respectively, then which of the following is wrong?
(e1) | (e2) is a regular expression denoting L1 ∪ L2
(e1) .(e2) is a regular expression denoting L1. L2
φ is not a regular expression
{ex} is a regular expression denoting L1*
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
