F_p-affine recurrent n-dimensional sequences over F_q are p-automatic

DOI10.1016/J.EJC.2012.07.004zbMATH Open1302.11008OpenAlexW1548293559MaRDI QIDQ691584FDOQ691584

Authors: Mihai Prunescu 

Publication date: 3 December 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.004

Recommendations

• A two-valued recurrent double sequence that is not automatic
• scientific article; zbMATH DE number 4065109
• Polynomial subsequences of certain automatic sequences
• Recurrent two-dimensional sequences generated by homomorphisms of finite abelian \(p\)-groups with periodic initial conditions
• A characterization of \(p\)-automatic sequences as columns of linear cellular automata

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Combinatorics on words (68R15) Recurrences (11B37) Automata sequences (11B85)

Cited In (3)

• A two-valued recurrent double sequence that is not automatic
• A growth model based on the arithmetic \(Z\)-game
• Recurrent two-dimensional sequences generated by homomorphisms of finite abelian \(p\)-groups with periodic initial conditions

This page was built for publication: \(\mathbb F_p\)-affine recurrent \(n\)-dimensional sequences over \(\mathbb F_q\) are \(p\)-automatic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691584)