" All infinite languages that’s requires no comparison and memory they are regular "-true or false

# Infinite languages that's requires no comparison and memory are regular?

All infinite languages that’s requires no comparison and memory they are regular "

It is True I think

**Harsha_1997**#5

False.

All finite sets are regular but infinite sets may not be a regular set.

An example for an infinite but non regular set {a^nb^n/n>0}.

if we draw the venn diagram for the example given above ie-{a^nb^n/n>0} we can clearly get a view that every finite set is regular.infinite set may be regular or may not be regular.

in example a^nb^n/n>0, We need to compare number of a s and b s. So comparisons are required. But in the question he asked about comparison not required languages.