| changeset 471 | 9476086849ad |
| parent 444 | 3056a4c071b0 |
| child 499 | dfd0f41f8668 |
| 469:1f4e81950ab4 | 471:9476086849ad |
|---|---|
94 |
94 |
95 \[ |
95 \[ |
96 zeroable(\sim r) \dn \neg(zeroable(r)) |
96 zeroable(\sim r) \dn \neg(zeroable(r)) |
97 \] |
97 \] |
98 |
98 |
99 Find out why? |
99 Find a counter example? |
100 |
100 |
101 \item Give a regular expressions that can recognise all |
101 \item Give a regular expressions that can recognise all |
102 strings from the language $\{a^n\;|\;\exists k.\; n = 3 k |
102 strings from the language $\{a^n\;|\;\exists k.\; n = 3 k |
103 + 1 \}$. |
103 + 1 \}$. |
104 |
104 |