Language Toc

Question

Why this is not a regular Language?

a^i  b^j^2 where  i,j >=1

Here , there is nothing to store or nothing to compare against with any thing i and j are independent of each other why can't we generate them independently .Why can't we say any no of a's followed by any no of b's. and create a FA.

Comments

But in ur assumption all strings belongs to aⁱ b^j2 are accepted till then its ok but the thing is in ur assumption the strings which doesn't belongs to language aⁱ b^j2 also accepted this is to be avoided right so ur assumption fails at accepting strings that doesn't belongs to language

---

It is a CSL , right ?

---

@Kapil I think its type 0 language not CSL

Answer 1

In FSM we find some series and we try to draw FA

Here aⁱ b^j2 we can find that aⁱ could be easily drawn but the thing is with b^j2 

aⁱ ={a,aa,aaa,aaaa .....} here each time an a gets1 more time

 b^j2 ={b,bbbb,bbbbbbbbb ........} here we can't have sequence for 1,4,9, ........ 

Since their is no sequence we unable to draw the FA

As FA is not possible it is not Regular

Comments

This is what i want to say hope u understood

---

yes ,I totally got you genius.

---

i told that u r talented...beautiful explanation