Question

what is regular and not regular language?

Answer 1

Explanation:

Hey dear...✌

Answer....

Given an expression of non-regular language, but the value of parameter is bounded by some constant,

then the language is regular (means it has kind of finite comparison)

. Example 2 – L = { | n <= 101010} is regular,

because it is upper bounded and thus a finite language.

✌❤hope it helps you✌❤