"A Combinatorial Proof of S-adicity for Sequences with Linear Complexity."

Julien Leroy, Gwénaël Richomme (2013)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition @ colgate.edu (open access)
- export record
  dblp key:
  - journals/int/LeroyR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/int/LeroyR13
Julien Leroy, Gwénaël Richomme:
A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers 13: A5 (2013)

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.