A two-valued recurrent double sequence that is not automatic
A double sequence is an infinite (towards right and down) matrix consisting of symbols of an alphabet \(\Sigma\). A recurrent double sequence is determined by its given borders: zero's row, zero's column, and a finite function assigning to each inner position a symbol based on the three symbols contained in the left neighbor, the upper left diagonal neighbor and the upper neighbor of the position. A double sequence \(a\) on \(\Sigma\) is \(k,l\)-automatic, if there is a finite automaton with an input alphabet consisting of pairs of digits in base \(k,l\geq2\), respectively and the set of states partitioned to classes denoted by symbols from \(\Sigma\), such that processing a sequence of pairs encoding the two coordinates of a position (in base \(k,l\geq2\), respectively) in \(a\) leads to a state from the class denoted by the symbol of \(a\) in that position. The paper provides a recurrent double sequence \(t\) on a binary alphabet having constant borders, which is not \(k,l\)-automatic for any \(k,l\geq2\), while all its rows are periodic, the \(n\)-th row with minimal period of \(2^{n}\). It is documented that, among all recurrent double sequences on a binary alphabet with constant borders, there are 3 sequences analogue to \(t\), 4 other sequences with unknown automaticity properties, while all the remaining sequences are \(k,l\)-automatic (each for a suitable \(k,l\)).
- An undecidable property of recurrent double sequences
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- A pair of rational double sequences
- On regularly generated double sequences
- RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
- Two rational recursive sequences
- scientific article; zbMATH DE number 4036113
- The distribution of elements in automatic double sequences
- scientific article; zbMATH DE number 859438
- F_p-affine recurrent n-dimensional sequences over F_q are p-automatic
- A characterization of \(p\)-automatic sequences as columns of linear cellular automata
- An undecidable property of recurrent double sequences
- Automatic Sequences
- scientific article; zbMATH DE number 1001617 (Why is no real title available?)
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 4021221 (Why is no real title available?)
- scientific article; zbMATH DE number 4065109 (Why is no real title available?)
- scientific article; zbMATH DE number 3794378 (Why is no real title available?)
- Linear recurrent double sequences with constant border in \(M_2(\mathbb F_2)\) are classified according to their geometric content
- RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
- Recurrent two-dimensional sequences generated by homomorphisms of finite abelian p-groups with periodic initial conditions
- Resolution of an integral equation with the Thue-Morse sequence
- Revealing non-analytic kinematic shifts in smooth goal-directed behaviour
- Self-similar carpets over finite fields
- Suites algébriques, automates et substitutions
- The Thue-Morse-Pascal double sequence and similar structures
- Uniform tag sequences
- Automaticity of rational functions
- RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
- Doubly-Periodic Sequences and Two-Dimensional Recurrences
- Linear recurrent double sequences with constant border in \(M_2(\mathbb F_2)\) are classified according to their geometric content
- Recurrent two-dimensional sequences generated by homomorphisms of finite abelian p-groups with periodic initial conditions
- The Thue-Morse-Pascal double sequence and similar structures
- F_p-affine recurrent n-dimensional sequences over F_q are p-automatic
- An undecidable property of recurrent double sequences
This page was built for publication: A two-valued recurrent double sequence that is not automatic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437852)
