Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by AVICS
0
answers
1
Consider a language L = {xaybzc| ((a ≤ b) or (a > b)) and (a ≠ c)}. Select the correct option.
consider a language L = {x^{a}y^{b}z^{c}| ((a ≤ b) or (a > b)) and (a ≠ c)}. Select the correct option. 1.L is CFL but not DCFL. 2.L is recursive but not CSL. 3. L is DCFL but not regular. 4.L is CSL but not CFL.
consider a language L = {x^{a}y^{b}z^{c}| ((a ≤ b) or (a b)) and (a ≠ c)}. Select the correct option.1.L is CFL but not DCFL.2.L is recursive but not CSL.3. L is DCF...
390
views
asked
Jan 28, 2019
Theory of Computation
theory-of-computation
context-free-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register