A combinatorial proof of S-adicity for sequences with linear complexity

Leroy, Julien; Richomme, Gwenaël

Download

Article (Scientific journals)

A combinatorial proof of S-adicity for sequences with linear complexity

Leroy, Julien; Richomme, Gwenaël

2013 • In Integers, 13, p. 5, 19

Peer Reviewed verified by ORBi

Permalink
https://hdl.handle.net/2268/174954

Files (1)Send to Details Statistics Bibliography Similar publications

Files

Full Text

preprint.pdf

Author postprint (261.48 kB)

Download

All documents in ORBi are protected by a user license.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Disciplines :

Mathematics

Author, co-author :

Leroy, Julien ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes

Richomme, Gwenaël

Language :

English

Title :

A combinatorial proof of S-adicity for sequences with linear complexity

Publication date :

January 2013

Journal title :

Integers

eISSN :

1553-1732

Publisher :

Integers, Carrollton, United States - Georgia

Volume :

Pages :

Paper No. A5, 19

Peer reviewed :

Peer Reviewed verified by ORBi

Commentary :

3083467

Available on ORBi :

since 11 December 2014

Statistics

Number of views

56 (0 by ULiège)

Number of downloads

94 (1 by ULiège)

More statistics