1 votes 1 votes Writw the regular expression with explaination Deepalitrapti asked Aug 16, 2018 Deepalitrapti 307 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply arvin commented Aug 16, 2018 reply Follow Share what is the conditoin for m and n? 0 votes 0 votes Deepanshu commented Aug 16, 2018 i edited by Deepanshu Aug 16, 2018 reply Follow Share IF M,N>=0 THEN THIS CONDITON BECOMES a^nb^m |n != m FOR N<M OR N>M which is pda so i think there is no regular expression for pda @arvin AM I RIGHT?? 1 votes 1 votes Verma Ashish commented Aug 16, 2018 i reshown by Verma Ashish Aug 16, 2018 reply Follow Share Yes it is not regular language. Moreover it is not n<m and n>m, it have to be n<m or n>m. Which is n≠m 1 votes 1 votes arvin commented Aug 16, 2018 i edited by arvin Aug 16, 2018 reply Follow Share yes u are right @deepanshu. but if it was m>n or n>m you can have expressed it as (a*b*- anbn | n>0) which is regular intersection dcfl = dcfl.. hence the language is a DCFL. so RE cannot be drawn for this. but its different see the solution. 0 votes 0 votes Please log in or register to add a comment.
Best answer 1 votes 1 votes see its a tricky question . it says m>n and m<n. which means it wont accept anything. means, we will have dfa accepting Φ means empty means no input string exists. and this can be done with minimal dfa having 1 state with no final states. arvin answered Aug 16, 2018 selected Aug 16, 2018 by Deepalitrapti arvin comment Share Follow See all 2 Comments See all 2 2 Comments reply Deepanshu commented Aug 16, 2018 reply Follow Share NICE BRO . THATS WHY WE HAVE TO READ EVERY QUESTION STATEMENT CAREFULLY . BECAUSE ONE WORD CAN MAKE VERY BIG DIFFERENCE. 0 votes 0 votes arvin commented Aug 16, 2018 reply Follow Share yes bro u really need to think differently for such questions. i mean i too missed it at first . 0 votes 0 votes Please log in or register to add a comment.