SELF DOUBT

Question

L= { $a^n$$b^n$ , n<10000 }

it is regular language as still states are finite means we have create around 20000 states  but still states are finite so it is regular .

AM I GOING IN RIGHT DIRECTION ?????

Comments

But how we will keep a track on the equality of $a$ and $b$

---

Yes, it is regular.it will take finite memory.

---

is my approach correct kumar.dilip

---

Yes. Even $a^{n}b^{n}c^{n} , n < 10000$ is regular.

Answer 1

yes it is regular, only finite number of string is present. and every finite language is always regular.