1 votes 1 votes here my doubt is the language generated by above contain compression among substring or not.... what is a type of language is generated here?? Theory of Computation identify-class-language + – Hira Thakur asked Dec 17, 2017 Hira Thakur 261 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Ashwin Kulkarni commented Dec 17, 2017 i edited by Ashwin Kulkarni Dec 17, 2017 reply Follow Share it is regular and language generated is a(a+b)*a + b(a+b)*b + a* + b* 1 votes 1 votes Hira Thakur commented Dec 17, 2017 reply Follow Share Ashwin Kulkarni the DFA having 2 final states. please verify it? 0 votes 0 votes joshi_nitish commented Dec 17, 2017 reply Follow Share @Ashwin, your RE is not correct, correct RE should be a(a+b)*a + b(a+b)*b + a* + b* 0 votes 0 votes Ashwin Kulkarni commented Dec 17, 2017 reply Follow Share I was thinking the same initially but then I thought something wrong! simple bad mistake :( 0 votes 0 votes Please log in or register to add a comment.
