Regular language identification

Question

Is Language L = {0^(n+m)  1^(k+l) | m = l, and m,n,k,l  ≥  1 } a regular language ? explain

Comments

Will not be regular.....take 0^m0^n1^m1^l and make a dfa ..yo will see that it accepts for m=l and also for m!=l so no dfa can be constructed and thus not regular

---

Well according to me it shouldn't be regular but it is according to made easy test series :(

---

check the answer.

---

Good question :)

Answer 1

yes, it is Regular Language.

0^(n+m)  1^(k+l) = 0^P . 1^Q .

Note that there is a relation Between m and l but there is no relation between P and Q, due to n and k

therefore given language is regular.

If you didn't get this, give a string which is in the language, i will accept using FA, and give a string which is not in the language, i will reject it by FA and check this FA

i hope you are thinking let l=1, m=5 and l=3 and k=1 ===> 0 00000 111 1

i converted it as 00000 0 1 111 ===> n= 5, m=1,l=1,k=3 ==> m=l and l,m,n,k ≥ 1

Comments

why you are putting m=1 .here there is storing and comparison with m and l ????.in textbook i have read that PDA and TM and LBA has storing memory dfa and nfa does not .

---

still you didn't get after reading the comments ?

---

its my basic mistake .got it