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


#1

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


#2

All infinite languages that’s requires no comparison and memory they are regular "
It is True I think


#3

false.

As a simple example consider this language:
L={a^p : p is a prime number}


#4

ThnkQ @ruturaj_mohanty


#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.


#6

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.