𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Automaticity of double sequences generated by one-dimensional linear cellular automata

✍ Scribed by J.-P Allouche; F von Haeseler; H.-O Peitgen; A Petersen; G Skordev

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
991 KB
Volume
188
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

✦ Synopsis

We give a complete answer to the question whether a double sequence that is generated by a one-dimensional linear cellular automaton, and whose states are integers modulo m, is k-automatic or not.

πŸ“œ SIMILAR VOLUMES

Synthesis of cryptographic interleaved s
Synthesis of cryptographic interleaved sequences by means of linear cellular automata
✍ Amparo FΓΊster-Sabater; P. Caballero-Gil πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 436 KB

This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coeffici

Simulation of one-dimensional cellular a
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
✍ Jia Lee; Katsunobu Imai; Kenichi Morita πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 260 KB

A uniquely parsable grammar (UPG) introduced by Morita et al. (Acta Inform. 34 (1997) ) is a special kind of generative grammar where parsing can be performed without backtracking. By extending a UPG, a uniquely parallel parsable grammar (UPPG) was proposed and its unique parallel parsability has be