𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Iteration of maps by an automaton

✍ Scribed by F.M. Dekking


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
306 KB
Volume
126
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


Let x=(x1, x2,. .) with the xi elements of a finite set A be an automatic sequence, i.e., x is generated by a tag machine with deletion number one. Let F be a finite set and suppose maps rp,: F+F are given for all aEA. It is shown constructively that the sequence of iterates (cp,,, cpx,ocpxl, cpx,"cpx,"cpx~."' ) is again an automatic sequence.


πŸ“œ SIMILAR VOLUMES


An iterated implicit complex map
✍ Shaun R. Bullett; Andrew H. Osbaldestin; Ian C. Percival πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 720 KB
Strong convergence of an iterative metho
✍ Yisheng Song; Rudong Chen πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 142 KB

## Abstract Let __E__ be a real reflexive Banach space having a weakly continuous duality mapping __J__~__Ο†__~ with a gauge function __Ο†__, and let __K__ be a nonempty closed convex subset of __E__. Suppose that __T__ is a non‐expansive mapping from __K__ into itself such that __F__ (__T__) β‰  βˆ…οΈ.