"The subword complexity of a class of infinite binary words."

Irina Gheorghiciuc (2007)

> Home

Details and statistics

DOI: 10.1016/J.AAM.2006.04.001

access: closed

type: Journal Article

metadata version: 2019-08-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aam/Gheorghiciuc07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aam/Gheorghiciuc07
Irina Gheorghiciuc:
The subword complexity of a class of infinite binary words. Adv. Appl. Math. 39(2): 237-259 (2007)

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.