The Gateway to Computer Science Excellence
+4 votes

in Theory of Computation by (79 points)
edited by | 139 views
Language is (a+b)* .. which is regular.
@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?
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.
A.B doesn't mean that language B should follow language A?
try to generate any language which cannot inside A.B
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

rajatmyname who said they are regular?

it is regular. there is no comparison between a and b.

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,833 questions
57,748 answers
108,121 users