"The Maximal Subword Complexity of Quasiperiodic Infinite Words"

Ronny Polley, Ludwig Staiger (2010)

> Home

Details and statistics

DOI: 10.4204/EPTCS.31.19

access: open

type: Conference or Workshop Paper

metadata version: 2018-09-12

- view
  - electronic edition via DOI (open access)
  - electronic edition @ arxiv.org (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-1008-1659
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1008-1659
Ronny Polley, Ludwig Staiger:
The Maximal Subword Complexity of Quasiperiodic Infinite Words. DCFS 2010: 169-176

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.