|
|||||
|
|
Subword complexity and non-automaticity of certain completely multiplicative functions |
|
| Institution: | CNRS, Institut de Mathématiques de Jussieu-PRG, Université Pierre et Marie Curie, Case 247, 4 Place Jussieu, F-75252 Paris Cedex 05, France |
| Abstract: | |
| Keywords: | Completely multiplicative functions Subword complexity |
| 本文献已被 ScienceDirect 等数据库收录！ | |