2 votes 2 votes Theory of Computation theory-of-computation identify-class-language + – reena_kandari asked Jul 31, 2017 reena_kandari 334 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes (A) L is regular L = {w | w contains equal number of ab and ba }: strings in language: eps, a*, b*, aba, abbbbba ababa .... Regular Expression: $ eps+ a(a + bb^{*}a)^{*} + b(b + aa^{*}b)^{*}$ DFA: Manu Thakur answered Aug 2, 2017 selected Aug 2, 2017 by Vijay Thakur Manu Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes L is regular.. just ensure that if you start with 'a' you should end with 'a' and if start with 'b' then end with 'b'.... dfa will be. joshi_nitish answered Aug 2, 2017 joshi_nitish comment Share Follow See 1 comment See all 1 1 comment reply reena_kandari commented Aug 9, 2017 reply Follow Share yes it is same as saying that , language that start and end with the same letter. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Ans : B. L is a DCFL but not regular harirose answered Aug 2, 2017 harirose comment Share Follow See all 0 reply Please log in or register to add a comment.