<?xml version="1.0"?>
<!-- name="generator" content="blosxom/2.0" -->
<!DOCTYPE rss PUBLIC "-//Netscape Communications//DTD RSS 0.91//EN" "http://my.netscape.com/publish/formats/rss-0.91.dtd">

<rss version="0.91">
  <channel>
    <title>Notebooks   </title>
    <link>http://bactra.org/notebooks</link>
    <description>Cosma's Notebooks</description>
    <language>en</language>

  <item>
    <title>&lt;!-- Created by HTMX version 4.0 --&gt;</title>
    <link>http://bactra.org/notebooks/2005/11/13#symbolic-dynamics</link>
    <description>Symbolic Dynamics 

&lt;P&gt;A useful method for studying discrete-time dynamical systems with continuous 
state spaces.  The basic idea is to take the state space and partition it into 
a finite number of regions, each of which you label with some symbol.  Each 
point in the state space then gives you an infinite sequence of symbols: the 
symbol for the cell of the partition of the original point, the symbol for the 
cell of its first iterate, its second, and so forth.  Normally this involves 
some loss of information, since you're going from continuous to discrete 
values.  The symbolic dynamics are often &lt;a 
href=&quot;stochastic-processes.html&quot;&gt;stochastic&lt;/a&gt; even when the continuous 
dynamics are deterministic, for starters.  So why do this? 

&lt;P&gt;One reason is that the dynamics &lt;em&gt;as such&lt;/em&gt; are drastically simplified. 
Let me introduce some notation here.  Write  
&lt;img align=absmiddle src=&quot;symbolic-dynamics_1.gif&quot; alt=&quot;$ x $ &quot;&gt;
 for the continuous 
state,  
&lt;img align=absmiddle src=&quot;symbolic-dynamics_2.gif&quot; alt=&quot;$ f $ &quot;&gt;
 for the map, and  
&lt;img align=absmiddle src=&quot;symbolic-dynamics_3.gif&quot; alt=&quot;$ \phi $ &quot;&gt;
 for the function taking 
states to symbols.  Then the symbol sequence  
&lt;img align=absmiddle src=&quot;symbolic-dynamics_4.gif&quot; alt=&quot;$ s = \phi(x) \phi(f(x)) 
\phi(f^2(x)) \phi(f^3(x)) \ldots $ &quot;&gt;
 .  Now suppose I started with 
 
&lt;img align=absmiddle src=&quot;symbolic-dynamics_5.gif&quot; alt=&quot;$ f(x) $ &quot;&gt;
 instead; my sequence would be 
 
&lt;img align=absmiddle src=&quot;symbolic-dynamics_6.gif&quot; alt=&quot;$ \phi(f(x)) \phi(f^2(x)) \phi(f^3(x)) \ldots $ &quot;&gt;
 .  So the dynamics on 
the space of symbol sequences just consists of shifting to the right: 
 
&lt;img align=absmiddle src=&quot;symbolic-dynamics_7.gif&quot; alt=&quot;$ s_0 s_1 s_2 \ldots \mapsto s_1 s_2 \ldots $ &quot;&gt;
 .  (This is called 
the &lt;em&gt;shift map&lt;/em&gt;.)  This is completely trivial.  All of the structure in 
the problem has been shifted from the map to space of sequences.  For instance, 
certain subsequences may not occur at all, or differ in probability.  But we 
have a lot of tools for studying sets of discrete symbol sequences --- not just 
stochastic process theory, but the theory of &lt;a href=&quot;computation.html&quot;&gt;formal 
languages&lt;/a&gt;, for instance, so that we can write out the abstract automata 
which &lt;em&gt;generate&lt;/em&gt; the symbol sequences produced by the dynamics. 

&lt;P&gt;The other reason for using symbolic dynamics is that there are important 
cases where one can find &lt;em&gt;generating partitions&lt;/em&gt; --- mappings into 
symbols where there is a one-to-one correspondence between continuous states 
and the symbol sequences they generate.  In these cases, studying the symbolic 
dynamics is completely equivalent to studying the original dynamics. 
Remarkably enough, even with a generating partition, the symbolic dynamics can 
be stochastic for an underlying deterministic system.  In this way, for 
instance, one can show that some kinds of (sufficiently chaotic) deterministic 
dynamics are in a sense completely equivalent to sources of independent, 
identically-distributed random variables. 

&lt;P&gt;To go off on a tangent, there's something of a movement in &lt;a 
href=&quot;cognitive-science.html&quot;&gt;cognitive science&lt;/a&gt; which sets up an opposition 
between computation, conceived in the usual symbol-manipulation sense, and 
continuous nonlinear dynamics.  This seems to me &lt;a 
href=&quot;dynamics-cognition.html&quot;&gt;quite wrong-headed&lt;/a&gt;, if only because the 
existence of generating partitions shows how symbol-manipulating computation 
can be &lt;em&gt;completely equivalent&lt;/em&gt; to a dynamical system.  Computation 
is &lt;em&gt;intrinsic&lt;/em&gt; to dynamics, but that's another 
&lt;a href=&quot;computational-mechanics.html&quot;&gt;topic&lt;/a&gt;. 

&lt;P&gt;The most fundamental reason I like symbolic dynamics is that I know a lot 
of &lt;a href=&quot;../research/&quot;&gt;tricks for predicting discrete stochastic 
processes&lt;/a&gt;, and want to exploit them as widely as possible. 

&lt;P&gt;Cf. 
	&lt;a href=&quot;computation.html&quot;&gt;Computation, Automata and Formal 
Languages&lt;/a&gt;; 
	&lt;a href=&quot;computational-mechanics.html&quot;&gt;Computational Mechanics&lt;/a&gt;; 
	&lt;a href=&quot;dynamics-congition.html&quot;&gt;Dynamics in Cognitive Science&lt;/a&gt;; 
	&lt;a href=&quot;ergodic-theory.html&quot;&gt;Ergodic Theory&lt;/a&gt;; 
	&lt;a href=&quot;information-theory.html&quot;&gt;Information Theory&lt;/a&gt;; 
	&lt;a href=&quot;chaos.html&quot;&gt;Nonlinear Dynamics&lt;/a&gt;; 
	&lt;a href=&quot;time-series.html&quot;&gt;Time Series&lt;/a&gt; 

&lt;ul&gt;Recommended: 
	&lt;li&gt;R. L. Adler and B. Weiss, &quot;Entropy, a Complete Metric Invariant for 
Automorphisms of the Torus&quot;, &lt;citE&gt;Proceedings of the National Academy of 
Sciences&lt;/cite&gt; (USA) &lt;strong&gt;57&lt;/strong&gt; (1967): 1573--1576 
[&lt;a href=&quot;http://www.pnas.org/cgi/reprint/57/6/1573&quot;&gt;PDf reprint&lt;/a&gt;.  Classic 
and cute, if somewhat specialized, paper.] 
	&lt;li&gt;Remo Badii and Antonio Politi, &lt;cite&gt;Complexity: Hierarchical 
Structures and Scaling in Physics&lt;/cite&gt; [&lt;a 
href=&quot;../reviews/badii-and-politi/&quot;&gt;Review&lt;/a&gt;, with some more explanation] 
	&lt;li&gt;C. Beck and F. Sch&amp;ouml;gl, &lt;cite&gt;Thermodynamics of Chaotic 
Systems&lt;/cite&gt; [Applying the thermodynamic formalism to symbolic dynamics] 
	&lt;li&gt;Peter beim Graben and Harald Atmanspacher, &quot;Complementarity in 
Classical Dynamical Systems&quot;, &lt;a 
href=&quot;http://arxiv.org/abs/nlin.CD/0407046&quot;&gt;nlin.CD/0407046&lt;/a&gt; [A really cool, 
if rather counter-intuitive, result about how one can get something which looks 
rather like quantum-mechanical &quot;complementarity&quot; (i.e., incompatible 
observables) from differing symbolic partitions of a single classical dynamical 
system.  I hasten to add that this is &lt;em&gt;not&lt;/em&gt; how I think &lt;a 
href=&quot;quantum-mechanics.html&quot;&gt;quantum mechanics&lt;/a&gt; works, and I'm pretty sure 
it's not how beim Graben and Atmanspacher think it works.] 
	&lt;li&gt;P.-M. Binder and Juan M. Pedraza, &quot;Nonregular Languages in the 
Kicked Rotor,&quot; &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;62&lt;/strong&gt; (2000): 
R5883--R5886 
	&lt;li&gt;Erik M. Bollt, Theodore Stanford, Ying-Cheng Lai and Karol 
Zyczkowski, &quot;What Symbolic Dynamics Do We Get with a Misplaced Partition?  On 
the Validity of Threshold Crossings Analysis of Chaotic Time-Series,&quot; 
&lt;cite&gt;Physica D&lt;/cite&gt; &lt;strong&gt;154&lt;/strong&gt; (2001): 259--286 [Short answer: You 
get &lt;em&gt;really wrong&lt;/em&gt; symbolic dynamics.] 
	&lt;li&gt;Milena C. Cuellar and P.-M. Binder, &quot;Reducing Noise in Discretized 
Time Series&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;64&lt;/strong&gt; (2001): 046211 
	&lt;li&gt;Ruslan L. Davidchack, Ying-Cheng Lai, Erik M. Bollt and Mukeshwar 
Dhamala, &quot;Estimating Generating Partitions of Chaotic Systems by Unstable 
Periodic Orbits,&quot; &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;Strong&gt;61&lt;/strong&gt; (2000): 
1353--1356 
	&lt;li&gt;R. L. Devaney, &lt;cite&gt;A First Course in Chaotic Dynamical 
Systems&lt;/cite&gt; 
	&lt;li&gt;Stefano Galatolo, Mathieu Hoyrup, and Crist&amp;oacute;bal Rojas, 
&quot;Effective symbolic dynamics, random points, statistical behavior, complexity 
and entropy&quot;, &lt;a href=&quot;http://arxiv.org/abs/0801.0209&quot;&gt;arxiv:0801.0209&lt;/a&gt; 
[&lt;em&gt;All&lt;/em&gt;, not almost all, Martin-Lof points are statistically 
typical.] 
	&lt;li&gt;Yoshito Hirata, Kevin Judd and Kazuyuki Aihara, &quot;Characterizing 
chaotic response of a squid axon through generating partitions&quot;, &lt;a 
href=&quot;http://dx.doi.org/10.1016/j.physleta.2005.07.081&quot;&gt;&lt;cite&gt;Physics Letters 
A&lt;/cite&gt; &lt;strong&gt;346&lt;/strong&gt; (2005): 141--147&lt;/a&gt; 
	&lt;li&gt;Yoshiro Hirata, Kevin Judd and Devin Kilaminster, &quot;Estimating a 
generating partition from observed time series: Symbolic shadowing&quot;, &lt;a 
href=&quot;http://link.aps.org/abstract/PRE/v70/e016215&quot;&gt;&lt;cite&gt;Physical Review 
E&lt;/cite&gt; &lt;strong&gt;70&lt;/strong&gt; (2004): 016215&lt;/a&gt; [A very elegant answer to &quot;how 
do we actually find a generating partition then?&quot;] 
	&lt;li&gt;Matthew B. Kennel and Michael Buhl, &quot;Estimating good discrete 
partitions from observed data: symbolic false nearest neighbors&quot;, &lt;a 
href=&quot;http://arxiv.org/abs/nlin.CD/0304054&quot;&gt;nlin.CD/0304054&lt;/a&gt; = &lt;citE&gt; 
Physical Review Letters&lt;/cite&gt; &lt;strong&gt;91&lt;/strong&gt; (2003): 084102 
	&lt;li&gt;Bruce P. Kitchens, &lt;cite&gt;Symbolic Dynamics&lt;/cite&gt; [More algebraic 
and less dynamical or probabilistic than I'd hoped.  But useful.] 
	&lt;li&gt;Douglas Lind and Brian Marcus, &lt;cite&gt;Introduction to Symbolic 
Dynamics and Coding&lt;/cite&gt; 
	&lt;/ul&gt; 

&lt;ul&gt;Sort-of recommended: 
	&lt;li&gt;Elena S. Dimitrova, John J. McGee, and Reinhard C. Laubenbacher, 
&quot;Discretization of Time Series 
Data&quot;, &lt;a href=&quot;http://arxiv.org/abs/q-bio.OT/0505028&quot;&gt;q-bio.OT/0505028&lt;/a&gt; 
[There are some interesting ideas here, and I like that they tested the ability 
of their discretization method to preserve information (in some sense) within 
and across time-series.  But they don't &lt;em&gt;compare&lt;/em&gt; its ability to 
preserve information with other discretization schemes (say, applying 
randomly-chosen cut-offs), and gave me no sense of why the scheme itself should 
work.] 
	&lt;/ul&gt; 

&lt;ul&gt;To read: 
	&lt;li&gt;Jon Aaronson and Hotoshi Nakada, &quot;Exchangeable, Gibbs and 
equilibrium measures for Markov subshifts&quot;, &lt;a 
href=&quot;http://arxiv.org/abs/math.PR/0505011&quot;&gt;math.PR/0505011&lt;/a&gt; 
	&lt;li&gt;Fatihcan Atay, Sarika Jalan and J&amp;uuml;rgen Jost, &quot;Randomness, 
chaos, and 
structure&quot;, &lt;a href=&quot;http://arxiv.org/abs/0711.4293&quot;&gt;arxiv:0711.4293&lt;/a&gt; 
	&lt;li&gt;Rajeev K. Azad, J. Subba Rao, and Ramakrishna Ramaswamy, &quot;Symbol 
sequence analysis of climatic time signals&quot;, 
&lt;a href=&quot;http://dx.doi.org/10.1016/j.nonrwa.2003.11.003&quot;&gt;&lt;cite&gt;Nonlinear 
Analysis: Real-World Applications&lt;/cite&gt; &lt;strong&gt;5&lt;/strong&gt; (2004): 
487--500&lt;/a&gt; 
	&lt;li&gt;Peter beim Graben, J. Douglas Saddy, Matthias Schlesewsky and 
J&amp;uuml;rgen Kurths, &quot;Symbolic Dynamics of Event-Related Brain Potentials,&quot; 
&lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;62&lt;/strong&gt; (2000): 5518--5541 
	&lt;li&gt;Camillo Cammarota and Enrico Rogora, &quot;Spectral and symbolic 
analysis of heart rate data during the tilt 
test&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.74.042903&quot;&gt;&lt;cite&gt;Physical 
Review E&lt;/cite&gt; &lt;strong&gt;74&lt;/strong&gt; (2006): &lt;/a&gt; 
	&lt;li&gt;Julien Cervelle, Enrico Formenti, Pierre Guillon, &quot;Sofic Trace of a 
Cellular 
Automaton&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.DS/0703241&quot;&gt;math.DS/0703241&lt;/a&gt; 
[When can the sequence of states at a particular site in a 
1D &lt;a href=&quot;cellular-automata.html&quot;&gt;cellular automaton&lt;/a&gt; give us a sofic 
shift, in the sense?] 
	&lt;li&gt;J.-R. Chazottes, L. Ramirez and E. Ugalde, &quot;Finite type 
approximations of Gibbs measures on sofic 
subshifts&quot;, &lt;a 
href=&quot;http://dx.doi.org/10.1088/0951-7715/18/1/023&quot;&gt;&lt;cite&gt;Nonlinearity&lt;/cite&gt; &lt;strong&gt;18&lt;/strong&gt; 
(2005): 445--463&lt;/a&gt; 
[&lt;a href=&quot;http://www.ifisica.uaslp.mx/~ugalde/Sobretiros/2005ChRU.pdf&quot;&gt;PDF 
reprint&lt;/a&gt; via Dr. Ugalde] 
	&lt;li&gt;Alex Clark and Lorenzo Sadun, &quot;When size matters: subshifts and 
their related tiling spaces,&quot; &lt;a 
href=&quot;http://arxiv.org/abs/math.DS/0201152&quot;&gt;math.DS/0201152&lt;/a&gt; 
	&lt;li&gt;Ethan M. Coven and Zbigniew H. Nitecki, &quot;On the genesis of symbolic 
dynamics as we know 
it&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.DS/0611322&quot;&gt;math.DS/0611322&lt;/a&gt; 
	&lt;li&gt;Jean-Charles Delvenne, Petr Kurka and Vincent Blondel, 
&quot;Computational Universality in Symbolic Dynamical Systems&quot;, &lt;a 
href=&quot;http://arxiv.org/abs/cs.CC/0404021&quot;&gt;cs.CC/0404021&lt;/a&gt; 
	&lt;li&gt;J. M. Finn, J. D. Goettee, Z. Toroczkai, M. Anghel and B. P.  Wood, 
&quot;Estimation of entropies and dimensions by nonlinear symbolic time series 
analysis&quot;, &lt;a 
href=&quot;http://dx.doi.org/10.1063/1.1555471&quot;&gt;&lt;cite&gt;Chaos&lt;/cite&gt; &lt;strong&gt;13&lt;/strong&gt; 
(2003): 444--456&lt;/a&gt; 
	&lt;li&gt;Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas, &quot;Effective 
symbolic dynamics, random points, statistical behavior, complexity and 
entropy&quot;, &lt;a href=&quot;http://arxiv.org/abs/0801.0209&quot;&gt;arxiv:0801.0209&lt;/a&gt; 
[&quot;consider the dynamical behavior of Martin-Lof random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic model for the dynamics. ... such points have typical statistical behavior (the behavior which is typical in the Birkhoff ergodic theorem) and are recurrent. We introduce and compare some notions of complexity for orbits in dynamical systems and prove: (i) that the complexity of the orbits of random points equals the Kolmogorov-Sinai entropy of the system, (ii) that the supremum of the complexity of orbits equals the topological entropy.&quot;] 
	&lt;li&gt;Bai-lin Hao 
		&lt;ul&gt; 
		&lt;li&gt;&lt;citE&gt;Applied Symbolic Dynamics&lt;/cite&gt; 
		&lt;li&gt;&quot;Applied Symbolic Dynamics,&quot; &lt;a 
href=&quot;http://arxiv.org/abs/chao-dyn/9806025&quot;&gt;chao-dyn/9806025&lt;/a&gt; [Presumably a 
resume of the book] 
		&lt;/ul&gt; 
	&lt;li&gt;Yoshito Hirata and Kevin Judd, &quot;Constructing dynamical systems with 
specified symbolic 
dynamics&quot;, &lt;a href=&quot;http://dx.doi.org/10.1063/1.1944467&quot;&gt;&lt;cite&gt;Chaos&lt;/cite&gt; 
&lt;strong&gt;15&lt;/strong&gt; (2005): 033102&lt;/a&gt; [explains &quot;how to construct signals 
(time series) of continuous-time dynamical systems that exhibit a given 
symbolic dynamics. This is achieved without construction of the ordinary 
differential equations that generate the flow. This construction is of 
theoretical interest and is useful as a source of dynamical data that can be 
used to test various data analysis algorithms.&quot;] 
	&lt;li&gt;Sarika Jalan, Fatihcan M. Atay and J&amp;uuml;rgen Jost, &quot;Detection of 
synchronised chaos in coupled map networks using symbolic 
dynamics&quot;, &lt;a href=&quot;http://arxiv.org/abs/nlin.CD/0510057&quot;&gt;nlin.CD/0510057&lt;/a&gt; 
	&lt;li&gt;Anders Johansson, Anders Oberg, and Mark 
Pollicott, &quot;Countable state shifts and uniqueness of g-measures&quot;, 
&lt;a href=&quot;http://arxiv.org/abs/math.DS/0509109&quot;&gt;math.DS/0509109&lt;/a&gt; 
	&lt;li&gt;Svetlana Katok and Ilie Ugarovici, &quot;Symbolic Dynamics for the Modular 
Surface and Beyond&quot;, &lt;cite&gt;Bulletion of the American Mathematical Scoeity&lt;/cite&gt; 
&lt;strong&gt;44&lt;/strong&gt; (n.s., 2007): 87--132 
[&lt;a 
href=&quot;http://www.ams.org/bull/2007-44-01/S0273-0979-06-01115-3/S0273-0979-06-01115-3.pdf&quot;&gt;PDF&lt;/a&gt;] 
	&lt;li&gt;Ljupco Kocarev and David M. Walker, &quot;Compactness of Symbolic 
Sequences from Chaotic Systems,&quot; &lt;cite&gt;Physics Letters 
A&lt;/cite&gt; &lt;strong&gt;274&lt;/strong&gt; (2000): 200--205 
	&lt;li&gt;Christophe Letellier, &quot;Estimating the Shannon Entropy: Recurrence 
Plots versus Symbolic Dynamics&quot;, &lt;a 
href=&quot;http://dx.doi.org/10.1103/PhysRevLett.96.254102&quot;&gt;&lt;cite&gt;Physical Review 
Letters&lt;/cite&gt; &lt;strong&gt;96&lt;/strong&gt; (2006): 254102&lt;/a&gt; 
	&lt;li&gt;Diana A. Mendes, Vivaldo M. Mendes, J. Sousa Ramos, &quot;Symbolic 
Dynamics in a Matching Labour Market 
Model&quot;,&lt;a href=&quot;http://arxiv.org/abs/nlin.CD/0608002&quot;&gt;nlin.CD/0608002&lt;/a&gt; 
	&lt;li&gt;George Osipenko, &lt;cite&gt;Lectures on Symbolic Analysis of Dynamical 
Systems&lt;/cite&gt; [&lt;a href=&quot;http://www.neva.ru/journal/osipenko/sad.pdf&quot;&gt;Online 
PDF&lt;/a&gt;] 
	&lt;li&gt;Shou-Li Peng and Ke-Fei Cao, &lt;cite&gt;Star Products in One-Dimensional 
Symbolic Dynamics&lt;/cite&gt; 
	&lt;li&gt;Marcus Pivato, &quot;Cellular Automata vs. Quasistrumian 
Shifts&quot;, &lt;cite&gt;Ergodic Theory and Dynamical 
Systems&lt;/cite&gt; &lt;strong&gt;forthcoming&lt;/strong&gt; (2005) = &lt;a 
href=&quot;http://arxiv.org/abs/math.DS/0503502&quot;&gt;math.DS/0503502&lt;/a&gt; 
	&lt;li&gt;E. Arthur Robinson and Ayse A. Sahin, &quot;On the Existence of Markov 
Partitions for    
&lt;img align=absmiddle src=&quot;symbolic-dynamics_8.gif&quot; alt=&quot;$ \mathbb{Z}^d $ &quot;&gt;
  Actions&quot;, &lt;cite&gt;Journal of the 
London Mathematical Society&lt;/cite&gt; &lt;strong&gt;69&lt;/strong&gt; (2004): 693--706 
	&lt;li&gt;Ben-Zion Rubshtein, &quot;On a class of one-sided Markov shifts&quot;, 
&lt;a href=&quot;http://arxiv.org/abs/math.DS/0406059&quot;&gt;math.DS/0406059&lt;/a&gt; 
	&lt;li&gt;Peter I. Saparin, Wolfgang Gowin, J&amp;uuml;rgen Kurths, and Dieter 
Felsenber, &quot;Quantification of cancellous bone structure using symbolic dynamics 
and measures of complexity&quot;, &lt;cite&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;58&lt;/strong&gt; 
(1998): 6449--6459 [&lt;a 
href=&quot;http://dx.doi.org/10.1103/PhysRevE.58.6449&quot;&gt;Journal link&lt;/a&gt;] 
	&lt;li&gt;Roy Wilds and Leon Glass, &quot;Contrasting methods for symbolic 
analysis of biological regulatory networks&quot;, &lt;a href=&quot;http://dx.doi.org/10.1103/PhysRevE.80.062902&quot;&gt;&lt;citE&gt;Physical Review E&lt;/cite&gt; &lt;strong&gt;80&lt;/strong&gt; (2009): 062902&lt;/a&gt; 
	&lt;li&gt;H.-M. Xie, &lt;cite&gt;Grammatical Complexity and One-Dimensional 
Dynamical Systems&lt;/cite&gt; 
	&lt;li&gt;Liqiang Zhu, Ying-Cheng Lai, Frank C. Hoppensteadt and Erik M. 
Bollt, &quot;Numerical and experimental investigation of the effect of filtering on 
chaotic symbolic dynamics&quot;, &lt;a 
href=&quot;http://dx.doi.org/10.1063/1.1520090&quot;&gt;&lt;cite&gt;Chaos&lt;/cite&gt; &lt;strong&gt;13&lt;/strong&gt; 
(2003): 410--419 
	&lt;/ul&gt; 
</description>
  </item>
  </channel>
</rss>