The Gateway to Computer Science Excellence
0 votes
81 views

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.

in Theory of Computation by (41 points) | 81 views
0
DCFL but not regular.
+2
(a ≤ b) or (a > b) ...this means that all cases of comparison between a and b are accepted.

and (a ≠ c) ....we  just need to compare this.

=> there is only one comparison for checking (a ≠ c)

=> it is DCFL.

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,365 answers
198,495 comments
105,262 users