1 votes 1 votes Is WcW CFG? Theory of Computation pushdown-automata + – Adiaspirant asked Jan 11, 2017 Adiaspirant 1.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 0 votes 0 votes No! Considering W ∈ {a,b}*, we can't draw a PDA for the language. Initially we push input alphabets (W) to stack and once we encounter c, we can't check if W = W. Rakеsh Kumar answered Jan 11, 2017 selected Jan 12, 2017 by Sushant Gokhale Rakеsh Kumar comment Share Follow See all 2 Comments See all 2 2 Comments reply Adiaspirant commented Jan 11, 2017 reply Follow Share I hope you are not getting confused with (W c Wreverse) 0 votes 0 votes Rakеsh Kumar commented Jan 11, 2017 reply Follow Share Updated! Thanks for pointing it out. 0 votes 0 votes Please log in or register to add a comment.