4 ms·
> At least IIRC, it's been a 20+ years since I last took a Discrete Math course :) Your memory is correct and there is very simple intuition for this. Regular
by School-Cotton 3y ago
> At least IIRC, it's been a 20+ years since I last took a Discrete Math course :)
Your memory is correct and there is very simple intuition for this. Regular languages are those that can be matched by a machine with bounded memory. So, let's say that bound is "n" bits. Then your machine will not be able to read in unary strings larger than 2^n.