Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
aa:intro:introduction [2016/07/27 16:48] pdmatei |
aa:intro:introduction [2016/07/27 16:49] (current) pdmatei |
||
|---|---|---|---|
| Line 7: | Line 7: | ||
| ==== Statement ==== | ==== Statement ==== | ||
| - | Let $\alpha_1, \ldots, \alpha_n$ and $\beta_1, \ldots, \beta_n$ be sequences of words over a fixed alphabet. There exists a finite sequence $math[a_1a_2 \ldots a_k], with $math[a_i = 1, \ldots n] such that: | + | Let $\alpha_1, \ldots, \alpha_n$ and $\beta_1, \ldots, \beta_n$ be sequences of words over a fixed alphabet. There exists a finite sequence $math[a_1a_2 \ldots a_k], with $math[a_i = 1, \ldots, n] such that: |
| $\alpha_{a_1}\alpha_{a_2}\ldots \alpha_{a_k} = \beta_{a_1}\beta_{a_2}\ldots \beta_{a_k}$ | $\alpha_{a_1}\alpha_{a_2}\ldots \alpha_{a_k} = \beta_{a_1}\beta_{a_2}\ldots \beta_{a_k}$ | ||
| + | |||
| + | ==== Example ==== | ||
| + | |||