Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
lfa:2023:lab08 [2023/12/08 13:22] alexandra.udrescu01 |
lfa:2023:lab08 [2023/12/08 13:23] (current) alexandra.udrescu01 |
||
|---|---|---|---|
| Line 283: | Line 283: | ||
| - | ====== Homework ====== | + | ====== Nice to try at home ====== |
| - | **Exercise I** $ L = \{ \: w \in \{0\}^* \: | \: \text{|w| is a power of 2} \: \} $ | + | **Exercise I** Show that $ \text{snd(L)}$ is a closure property for regular languages. |
| - | + | ||
| - | **Exercise II** Show that $ \text{snd(L)}$ is a closure property for regular languages. | + | |
| $ \text{snd(L)} = \{ \: w \: | \: xw \in L \: \text{, for some x such that |x| = |w|} \: \}$ | $ \text{snd(L)} = \{ \: w \: | \: xw \in L \: \text{, for some x such that |x| = |w|} \: \}$ | ||
| - | **Exercise III** Prove that $ L = \{ \: A^nB^mC^{n-m} \: | \: n \geq m \geq 0 \: \}$ is not a regular language without using isomorphisms. | + | **Exercise II** Prove that $ L = \{ \: A^nB^mC^{n-m} \: | \: n \geq m \geq 0 \: \}$ is not a regular language without using isomorphisms. |