0 votes 0 votes A language L is accepted by a pushdown automation if and only if it is A) Context Sensitive B)Recursive C)Context Free D)Right Linear Theory of Computation theory-of-computation pushdown-automata + – vivekpinto07 asked Jun 24, 2016 edited Jul 2, 2022 by Lakshman Bhaiya vivekpinto07 1.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes context free languages are accepted by push down automata option C rameshbabu answered Jun 24, 2016 rameshbabu comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Tauhin Gangwar commented Jun 24, 2016 reply Follow Share monty yes they also accepted by push down automata .but Right linear and left linear are subset of..context free languages 0 votes 0 votes vijaycs commented Jun 24, 2016 reply Follow Share Yes ... Tuhin ... even right linear and are regular language ... Hence here strongest ans should be CFL ... 0 votes 0 votes Tauhin Gangwar commented Jun 24, 2016 reply Follow Share yes...survival of the fittest shud be there.. 0 votes 0 votes Please log in or register to add a comment.