Symbolic sequence analysis using approximated partition

A particular attention has been paid to characterizing the dynamical behavior using symbolic sequences when there is no topological criterion to define the partition. In that case, a so-called threshold crossings technique is used. It is shown that maximizing the number of realized sequences provides a partition closer to the topological partition than using a partition leading to equiprobable symbols. After numerical evidences on benchmark maps, an experimental time series from a copper electrodissolution is used to check the applicability of this technique.