"Subword complexity and non-automaticity of certain completely ..."

Yining Hu (2017)

> Home

Details and statistics

DOI: 10.1016/J.AAM.2016.11.002

access: closed

type: Journal Article

metadata version: 2019-08-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aam/Hu17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aam/Hu17
Yining Hu:
Subword complexity and non-automaticity of certain completely multiplicative functions. Adv. Appl. Math. 84: 73-81 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.