scientific article; zbMATH DE number 23664
Let \(T: X\to X\) be a map, \(P=[P_ 0,\dots,P_{n-1}]\) a partition of \(X\). A word is a sequence of the partition elements: \(w=w_ 0w_ 1\dots w_ m\), \(w_ i\in P\), \(i=1,\dots,m\). The language \(L\) corresponding to \(T\) and \(P\) is defined by \(L=\{w: \exists x\in X \hbox{ such that for all }i=1,\dots,\hbox{length }w, T^ ix=w_ i\}\). Two families of maps are considered: (1) Unimodal maps defined on the unit interval as \[ T_ r(x)=2^{k- 1}r((1/2)^{(1+k)} - | x-1/2|^{(1+k)}), \] where \(0<k\) and \(r\in [2,4]\). \(P=[[0,1/2),\{1/2\},(1/2,1]]\). (2) Circle diffeomorphisms \(T_ r(x)=x+r+(k/2\pi)\sin(2\pi x)\) (\(\hbox{mod }1)\), where \(0<k<1\) and \(r\in [0,1]\). \(P=[[0,T(0)),(T(0),1)]\). It is shown that the set of parameters \(r\) that correspond to computationally simple behavior of the language contains an open and dense set. The set that corresponds to uncomputable behavior has positive measure.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3981973)