TOC Doubt about Regular Lang

Question

Let $L⊆Σ^*$ where $Σ=\{a,b\}.$ is above statement True?

L = {x∣x has n(a) >= n(b)} is regular?

Answer 1

let suppose L is regular then in this case....L must be finite.....

but here L is the subset of Sigma* (collection of all the strings..).....

and it doesn't guaranteed that (strings having N(a) =N(b) ) having finite number in sigma*

....therefor L is not REgular....

Comments

Is this correct?

Well, i think we can also say - L= {a^n b^m and n>=m} since n and m are dependent as a has to be greater than b and that needs computation therefore memory element is needed and hence it cannot be regular.

---

yeh..! perfect ...