[HTML][HTML] Self-similar carpets over finite fields
M Prunescu - European Journal of Combinatorics, 2009 - Elsevier
In [Dann E. Passoja, Akhlesh Lakhtakia, Carpets and rugs: An exercise in numbers,
Leonardo 25 (1)(1992) 69–71] an informal algorithm 'to display interesting numeric patterns' …
Leonardo 25 (1)(1992) 69–71] an informal algorithm 'to display interesting numeric patterns' …
Recurrent two-dimensional sequences generated by homomorphisms of finite abelian p-groups with periodic initial conditions
M Prunescu - Fractals, 2011 - World Scientific
We prove that if a recurrent two-dimensional sequence with periodic initial conditions
coincides in a sufficiently large starting square with a two-dimensional sequence produced …
coincides in a sufficiently large starting square with a two-dimensional sequence produced …
Recurrent double sequences that can be produced by context-free substitutions
M Prunescu - Fractals, 2010 - World Scientific
RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE
SUBSTITUTIONS Page 1 Fractals, Vol. 18, No. 1 (2010) 65–73 c World Scientific Publishing …
SUBSTITUTIONS Page 1 Fractals, Vol. 18, No. 1 (2010) 65–73 c World Scientific Publishing …
The Thue–Morse–Pascal double sequence and similar structures
M Prunescu - Comptes Rendus. Mathématique, 2011 - numdam.org
Si une suite bidimensionnelle récurrente avec conditions initiales définies par substitution
linéaire et une suite bidimensionnelle engendrée par substitution plane sont identiques sur …
linéaire et une suite bidimensionnelle engendrée par substitution plane sont identiques sur …
Linear recurrent double sequences with constant border in M 2 (F 2) are classified according to their geometric content
M Prunescu - Symmetry, 2011 - mdpi.com
The author used the automatic proof procedure introduced in and verified that the 4096
homomorphic recurrent double sequences with constant borders defined over Klein's …
homomorphic recurrent double sequences with constant borders defined over Klein's …
[HTML][HTML] Fp-affine recurrent n-dimensional sequences over Fq are p-automatic
M Prunescu - European Journal of Combinatorics, 2013 - Elsevier
A recurrent 2-dimensional sequence a (m, n) is given by fixing particular sequences a (m, 0),
a (0, n) as initial conditions and a rule of recurrence a (m, n)= f (a (m, n− 1), a (m− 1, n− 1), a …
a (0, n) as initial conditions and a rule of recurrence a (m, n)= f (a (m, n− 1), a (m− 1, n− 1), a …
[PDF][PDF] Some new counterexamples to context-free substitution in recurrent double sequences over finite sets
M Prunescu - Preprint, 2010 - mathematik.uni-freiburg.de
The recurrent double sequences over finite sets form a Turing complete model of
computation. Some recurrent double sequences can be deterministically produced by …
computation. Some recurrent double sequences can be deterministically produced by …
[HTML][HTML] A two-valued recurrent double sequence that is not automatic
M Prunescu - Theoretical Computer Science, 2014 - Elsevier
Abstract A recurrent 2-dimensional (double) sequence t (m, n) is given by fixing particular
sequences t (m, 0), t (0, n) as initial conditions and a rule of recurrence t (m, n)= f (t (m, n− 1) …
sequences t (m, 0), t (0, n) as initial conditions and a rule of recurrence t (m, n)= f (t (m, n− 1) …
[PDF][PDF] Homomorphisms of abelian p-groups produce p-automatic recurrent sequences
M Prunescu - researchgate.net
Abstract If v1,..., vm are lexicographically positive elements in Zn, a general recurrence is a
computation rule a (x)= f (a (x− v1),..., a (x− vm)). Let H be a finite abelian p-group, h: Hm→ H …
computation rule a (x)= f (a (x− v1),..., a (x− vm)). Let H be a finite abelian p-group, h: Hm→ H …
[PDF][PDF] Recurrent 2-dimensional sequences can encode counting
M Prunescu - academia.edu
Abstract A recurrent 2-dimensional (double) sequence t (m, n) is given by fixing particular
sequences t (m, 0), t (0, n) as initial conditions and a rule of recurrence t (m, n)= f (t (m, n− 1) …
sequences t (m, 0), t (0, n) as initial conditions and a rule of recurrence t (m, n)= f (t (m, n− 1) …