1 votes 1 votes Which of the following is the language L={0n#02n#03n│n≥0}( Marks: -0.33 ) Regular but not Context free Context free but not Regular Not Context free None of these atul_21 asked Jul 4, 2017 atul_21 508 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes 3. Not Context Free Language Manu Thakur answered Jul 4, 2017 Manu Thakur comment Share Follow See all 13 Comments See all 13 13 Comments reply Show 10 previous comments Prashant. commented Jul 6, 2017 reply Follow Share ok i will . Thanx Bdw answer is wrong. 0 votes 0 votes Manu Thakur commented Jul 7, 2017 i edited Jul 7, 2017 reply Follow Share +Prashant yes this language is not CFL, but the reason is not what you have given: +Nitesh as per your approach: 1. Push all 0's, until first # comes 2. Pop one 0 for each one 0, until stack becomes empty(Z0 appears on TOS) 3. When stack becomes empty, push all the 0's until second # comes 4. Now pop one zero for every three 0's 5. if stack becomes empty and input string is finished, accept the language. This machine will even accept 0^3#0^9#0^18 which not should be accepted as this is not in language 0 votes 0 votes Nitesh Choudhary commented Jul 7, 2017 reply Follow Share thanks so 3 is the answer 0 votes 0 votes Please log in or register to add a comment.