| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437789 | Theoretical Computer Science | 2009 | 15 Pages |
Abstract
The subword complexity of fixed points of some types of substitutions was studied by various authors. Here we introduce a family of substitutions, arising from multiplication tables of finite groups and other similar structures, and analyze their subword complexity.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
