622 views

1 Answer

Best answer
2 votes
2 votes

It is Regular Language .

In fact it is (a+b)*

Take any String Say ba : Here x is b and y is a (so no. of a in x is 0 and no. of b in y is also 0)

baa :Here x is b and y is aa (so no. of a in x is 0 and no. of b in y is also 0)

aabb : Here x is aa and y is bb (so no. of a in x is 2 and no. of b in y is also 2)

aaaa : Here x is Epsilon and y is aaaa (so no. of a in x is 0 and no. of b in y is also 0)

In this way , it is generating all String

selected by

Related questions

631
views
0 answers
5 votes
Himanshu1 asked Oct 31, 2015
631 views
L = {anbm | n mod m = 0 , n>=0 , m>0} Given language isA) CFLB) CSLC) DCFLD) RECE) RE
803
views
3 answers
1 votes
Shefali asked Oct 24, 2015
803 views
$L=\left\{ w\in(a+b)^* \mid w \\ \text{ has at least as many occurrences of (bba)'s as (abb)'s}\right\}$    Identify the class of the language.
1.4k
views
1 answers
0 votes
admin asked Sep 23, 2015
1,358 views
Identify the class of the language $L = \Bigl \{a^n b^m \mid n \leq m \leq 2n\Bigr \}$.a) CFL but not DCFLb) DCFL but not regularc) not CFL
475
views
1 answers
3 votes
Abhipsa asked Jan 22, 2019
475 views
Consider the infinite two-dimensional grid G={(m,n)| m and n are integers}Every point in G has 4 neighbors, North, South, East, and West, obtained by varying ... L is Regular.ii) L is context free.iii) L complement is context free.Thanks!