0 votes 0 votes Theory of Computation theory-of-computation + – Mudita asked Aug 26, 2018 Mudita 332 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shaik Masthan commented Aug 27, 2018 reply Follow Share questions from a-b, there is one comparission between (n+l) and k ===> DPDA question c, there is one comparission between either (n and l) or ( l and k ) ===> NPDA question d, there is one comparission between n and l ===> DPDA question e, there is one comparission between a and b ===>DPDA question f, there is one comparission required but it can't accomplished by stack, therefore we required queue ==>CSL ===> NTM question g, there is one comparission required but it can't accomplished by stack, therefore we required queue ==>CSL ===> NTM 0 votes 0 votes Chandrabhan Vishwa 1 commented Aug 27, 2018 reply Follow Share in case of first how we apply push and pop apply? 0 votes 0 votes Shaik Masthan commented Aug 27, 2018 reply Follow Share @Chandrabhan Vishwa 1 let take z as stack symbol, on getting a on empty stack ===> push z in to the stack, change state on getting a on z ===> push z in to the stack, don't change state on getting b on z ===> push z in to the stack, change state on getting b on z ===> push z in to the stack, don't change state on getting a on z ===> pop z from the stack, change state on getting a on z ===> pop z from the stack, don't change state check for empty stack on getting a ( if k > (n+l) ), check for empty stack on getting empty string ( if k = (n+l) ), 0 votes 0 votes Please log in or register to add a comment.