1 votes 1 votes L = { am bm cn dn ei fi | i > m>n>0 , i<= 10 } is DCFL or not? Theory of Computation theory-of-computation + – pps121 asked Nov 30, 2016 • retagged Jun 4, 2017 by Arjun pps121 489 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes i is bounded so m , n are also bounded so it is regular language so DCFL also Lokesh . answered Nov 30, 2016 • selected Nov 30, 2016 by Prajwal Bhat Lokesh . comment Share Follow See all 6 Comments See all 6 6 Comments reply Show 3 previous comments Veerendra V commented Nov 30, 2016 reply Follow Share I still couldn't get it. How m and n are bounded with i,j? is it possible to formulate regular expression or DFA? Can you guys please elaborate the explanation furthur? 0 votes 0 votes Lokesh . commented Nov 30, 2016 reply Follow Share i<=10 given so i is less than or equal to 10 and also n<m<i so m and n are also leass than 10 but greater than 0 so they are bounded 1 votes 1 votes Veerendra V commented Nov 30, 2016 reply Follow Share Okay got it. If m and n are independent of i then it is dcfl. Am I right? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes All regular languages are dcfl . . . As when regular language can be accepted by DFA same thing can be accepted using DPDA without a stack . . . So the answer is DCFL Pavan Kumar Munnam answered Nov 30, 2016 Pavan Kumar Munnam comment Share Follow See all 0 reply Please log in or register to add a comment.
