menu
search
Log In
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Dcfl or not

0 votes
390 views
L={w0w $\mid$ w$\in$(0+a+b)*}
in Theory of Computation
edited by 390 views
5
i think you missed something in question , I guess it is $w0w^R$

Otherwise it is CSL
0

@Praveen Sir, if it was WWR then it would hv been NCFL right?

And what is WW? Does it come under any language?

1
Yes then it was ncfl

In case of ww or as it is in question , it should be csl
1

As the question L={w0w ∣∣ w∈∈(0+a+b)*} it is not DCFL  if its just WW then it is csl

0

@Praveen Sir , If it was L ={ w0wr | w∈∈(0+a+b)*  then it should be NCFL right ??

1

right 

1
yes, NCFL.

2 Answers

0 votes
yes it is definetly CSL
0 votes
Not DCFL, NOT CFL , but CSL
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

4 votes
5 answers
1
1.3k views
CFL or DCFL?
Let $L = \{a^mb^nb^kd^l (n+k) \text{ is odd only if } m = l; m, n, k, l > 0\}$. Which of the following is true about $L$? $L$ is CFL but not DCFL $L$ is regular but not CFL $L$ is DCFL but not regular None of these
Let $L = \{a^mb^nb^kd^l (n+k) \text{ is odd only if } m = l; m, n, k, l > 0\}$. Which of the following is true about $L$? $L$ is CFL but not DCFL $L$ is regular but not CFL $L$ is DCFL but not regular None of these
asked Aug 2, 2016 in Theory of Computation neha singh 1.3k views
0 votes
1 answer
2
384 views
Language Regular or not
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}|n<m,n,m\geq 1 \right \}$
Is it regular? $\left \{ \left ( 0^{n} \right )^{m}|n<m,n,m\geq 1 \right \}$
asked May 24, 2018 in Theory of Computation srestha 384 views
0 votes
0 answers
3
209 views
Context free or not
How to understand such problems?
How to understand such problems?
asked Nov 20, 2017 in Theory of Computation Parshu gate 209 views
2 votes
1 answer
4
632 views
Regular/ Non Regular. Language is regular or not?
Is the following two languages regular? L = { $w$ | the number of occurrences of $'01'$ in $w$ is equal to the number of occurrences of $'10'$} Late(L) = {$x\in \Sigma^*$ : for some $a\in \Sigma$, string $ax\in L$ where $L$ is regular} (A) Only $I$ (B) Only $II$ (C) Both $I$ & $II$ (D) Neither $I$ nor $II$
Is the following two languages regular? L = { $w$ | the number of occurrences of $'01'$ in $w$ is equal to the number of occurrences of $'10'$} Late(L) = {$x\in \Sigma^*$ : for some $a\in \Sigma$, string $ax\in L$ where $L$ is regular} (A) Only $I$ (B) Only $II$ (C) Both $I$ & $II$ (D) Neither $I$ nor $II$
asked Nov 5, 2015 in Theory of Computation Iceberg 632 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...