edited by
1,166 views
1 votes
1 votes

I think the below language is Regular-
L = {xy | na(x) = nb(y) where  x,y $\in$ (a,b)* }

Doubt : Since if we consider any string in given language is split in such a way so that we satisfy the required condition. like
(abbbaa)(bbaba), (bbbbb)(a)  etc.
(Note - brackets are just for understanding purpose). Can some one write the regular grammar for this language?

edited by

1 Answer

0 votes
0 votes
Is it regular or CFL

I think it is CFL because Finite Automata can't compare .

Related questions

0 votes
0 votes
1 answer
1
saurabh rai asked Mar 27, 2018
375 views
What will be regular grammar for given regular expression$r=(ab^*+b)^*ab$