Glossary for combinatorics on words: Difference between revisions
No edit summary |
No edit summary |
||
| Line 40: | Line 40: | ||
| spectrum<ref>Bulgakova, D. V., Buzhinsky, N., & Goncharov, Y. O. (2023). On balanced and abelian properties of circular words over a ternary alphabet. Theoretical Computer Science, 939, 227-236.</ref> || [[interval class]] (generic interval) || | | spectrum<ref>Bulgakova, D. V., Buzhinsky, N., & Goncharov, Y. O. (2023). On balanced and abelian properties of circular words over a ternary alphabet. Theoretical Computer Science, 939, 227-236.</ref> || [[interval class]] (generic interval) || | ||
|- | |- | ||
| abelian complexity || (of the set of ''k''-steps) [[interval variety|variety]] of an [[interval class | | abelian complexity || (of the set of ''k''-steps) [[interval variety|variety]] of an [[interval class]]|| | ||
|- | |- | ||
| Parikh vector || interval occurring in a scale || A given subword ''w'' is associated with a ''Parikh vector'' whose coefficient for each letter ''a'' is |''w''|<sub>''a''</sub>, the number of occurrences of ''a'' in ''w''. The Parikh vector of a length-''k'' subword is a ''k''-step in xen terminology. | | Parikh vector || interval occurring in a scale || A given subword ''w'' is associated with a ''Parikh vector'' whose coefficient for each letter ''a'' is |''w''|<sub>''a''</sub>, the number of occurrences of ''a'' in ''w''. The Parikh vector of a length-''k'' subword is a ''k''-step in xen terminology. | ||