Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
theocs:lecture3 [2024/10/10 12:20] – tami | theocs:lecture3 [2024/10/10 12:22] (current) – tami | ||
---|---|---|---|
Line 11: | Line 11: | ||
* $\{\Lambda, | * $\{\Lambda, | ||
+ | |||
+ | Any finite languages is easy to build in this way $\implies$ **All finite languages are regular!** |