can you please tell me how can I show that there exists an algorithm that can determine for every regular language L, whether or not |L| ≥ 5

  • $\begingroup$ Regular language, not computer language? And if the latter: please explain some more then, so we can determine on which site this question might fit better. $\endgroup$ – Arjan Apr 7 '11 at 9:09
  • 1
    $\begingroup$ Sounds like a homework question. $\endgroup$ – Dave Clarke Apr 7 '11 at 9:55