Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
lfa:2022:lab03-dfa-regexp [2022/10/28 18:37] alexandra.udrescu01 |
lfa:2022:lab03-dfa-regexp [2022/10/28 22:42] (current) alexandra.udrescu01 |
||
|---|---|---|---|
| Line 70: | Line 70: | ||
| A* = {ε} (epsilon is always part of Kleene star) | A* = {ε} (epsilon is always part of Kleene star) | ||
| - | B*= {ε} (epsilon is always part of Kleene star) U {1^n} U {(1^(2n)} U {1^(3n)} U ... | + | B*= {ε} (epsilon is always part of Kleene star) U {$ 1^n $} U {$ 1^{2n} $} U {$ 1^{3n} $} U ... |
| - | So basically B = L( (1^n)* ) | + | So basically B = L( ($1^n$)* ) |
| </hidden> | </hidden> | ||
| Line 201: | Line 201: | ||
| 0000, 0010, 0100, 0110, 1000. | 0000, 0010, 0100, 0110, 1000. | ||
| - | So, this ugly regex encodes BCD numbers that start with exactly 2 odd digits which are followed by 0 or more eve | + | So, this ugly regex encodes BCD numbers that start with exactly 2 odd digits which are followed by 0 or more even digits. |
| - | n digits. | + | |
| </hidden> | </hidden> | ||