Construction of some nonautomatic sequences by cellular automata

DOI10.1007/978-3-319-92675-9_9OpenAlexW2804453498MaRDI QIDQ1656693

Thomas Stoll, Irène Marcovici, Pierre-Adrien Tahay

Publication date: 10 August 2018

Full work available at URL: https://hal.inria.fr/hal-01824876/file/469010_1_En_9_Chapter.pdf

zbMATH Keywords

cellular automatapolynomialsautomatic sequencescomputabilityFibonacci wordnonautomatic sequences

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Automata sequences (11B85) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

Column representation of Sturmian words in cellular automata, Characteristic Sequences of the Sets of Sums of Squares as Columns of Cellular Automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of \(p\)-automatic sequences as columns of linear cellular automata
• Directional dynamics along arbitrary curves in cellular automata
• Additive cellular automata and algebraic series
• Signals in one-dimensional cellular automata
• Non-Overlapping Codes
• Statistical mechanics of cellular automata
• Automatic Sequences
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• Unrecognizable Sets of Numbers
• Generation of Primes by a One-Dimensional Real-Time Iterative Array
• Finite Automata and the Set of Squares