Linear cellular automata and automatic sequences-Reference-Cited by-同舟云学术

Linear cellular automata and automatic sequences

Published:1997-11 Issue:11 Volume:23 Page:1577-1592
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Allouche J.-P.,Haeseler F.V.,Lange E.,Petersen A.,Skordev G.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference27 articles.

1. Automates finis en théorie des nombres;Allouche;Expositiones Mathematicae,1986

2. Linear cellular automata, finite automata, and Pascal's triangle;Allouche;Discrete Applied Mathematics,1996

3. J.-P. Allouche, F.V. Haeseler, H.-O. Peitgen, A. Petersen, G. Skordev, Automaticity of double sequences generated by one-dimensional linear cellular automata, to appear in: Theoretical Computer Science.

4. Schur congruences, Carlitz sequences of polynomials and automaticity;Allouche,1997

5. Factoring polynomials over finite fields;Berlekamp;Bell Systems Technical Journal,1967

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automaticity and Invariant Measures of Linear Cellular Automata;Canadian Journal of Mathematics;2019-09-05

2. Bibliography;Formal Languages, Automata and Numeration Systems 2;2014-09-12

3. Bibliography;Formal Languages, Automata and Numeration Systems 1;2014-09-12

4. Limit sets of automatic sequences;Advances in Mathematics;2003-05

5. On the Distribution of the Sums of Binomial Coefficients Modulo a Prime;Monatshefte f�r Mathematik;2000-12-01