theocs:lecture3

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision		 Previous revision
theocs:lecture3 [2024/10/10 12:18] – tamitheocs:lecture3 [2024/10/10 12:22] (current) – tami
Line 9: Line 9:
  
 **All** regular languages $\Sigma$ can be built from combining these four in various ways by **recursively using the union, product and closure operation**. **All** regular languages $\Sigma$ can be built from combining these four in various ways by **recursively using the union, product and closure operation**.
 +
 +  * $\{\Lambda,b\}$ is regular: $\{\Lambda\} \cup \{b\} = \{\Lambda, b\}$
 +
 +Any finite languages is easy to build in this way $\implies$ **All finite languages are regular!**
  • theocs/lecture3.1728562692.txt.gz
  • Last modified: 2024/10/10 12:18
  • by tami