4 votes 4 votes Theory of Computation testbook-test-series identify-class-language theory-of-computation + – Shailin Shah asked Jan 30, 2018 edited Mar 12, 2019 by ajaysoni1924 Shailin Shah 537 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Anu007 commented Jan 30, 2018 reply Follow Share Language is (a+b)* .. which is regular. 4 votes 4 votes rajatmyname commented Jan 30, 2018 reply Follow Share @Anu007 how B can be regular as the language B has to be stored and then compared with language A such that no of b is greater than or equal to number of a? 0 votes 0 votes Anu007 commented Jan 30, 2018 reply Follow Share A and B are almost complement of each other, no comparision done when both are concatinate i... a , b , aa, bb, ab, ba ,aba .... all are present in language. 2 votes 2 votes rajatmyname commented Jan 30, 2018 reply Follow Share A.B doesn't mean that language B should follow language A? 0 votes 0 votes Anu007 commented Jan 30, 2018 reply Follow Share try to generate any language which cannot inside A.B 2 votes 2 votes rajatmyname commented Jan 30, 2018 reply Follow Share Now I have one basic doubt that how A and B are regular since I know that regular language cannot be stored for further comparison. Correct me if I am wrong 0 votes 0 votes Mk Utkarsh commented Mar 23, 2018 reply Follow Share rajatmyname who said they are regular? 0 votes 0 votes abhishekmehta4u commented Mar 23, 2018 reply Follow Share it is regular. there is no comparison between a and b. 0 votes 0 votes Please log in or register to add a comment.