The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
25 views
Are following languages CFL? If so  please explain me how to draw a PDA

L1 = { xww$^{R}$ : x,w $\in$ (0,1)$^{+}$ }

L2 = { ww$^{R}$x : x,w $\in$ (0,1)$^{+}$ }  

L3 = { ww : w $\in$ (0,1)$^{+}$ }

w$^{R}$ : reverse
asked in Theory of Computation by (55 points) | 25 views
0
L1 and L2 are CFL and L3 is CSL.

Please log in or register to answer this question.

Related questions

+1 vote
0 answers
1
0 votes
0 answers
2
+2 votes
1 answer
3


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

38,203 questions
45,703 answers
132,818 comments
49,750 users