Hostname: page-component-89b8bd64d-nlwjb Total loading time: 0 Render date: 2026-05-11T06:51:21.116Z Has data issue: false hasContentIssue false

A survey on transitivity in discrete time dynamical systems. application to symbolic systems and related languages

Published online by Cambridge University Press:  20 July 2006

Gianpiero Cattaneo
Affiliation:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, via Bicocca degli Arcimboldi 8, 20126 Milano, Italy; cattang@disco.unimib.it; dennunzio@disco.unimib.it; farina@disco.unimib.it
Alberto Dennunzio
Affiliation:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, via Bicocca degli Arcimboldi 8, 20126 Milano, Italy; cattang@disco.unimib.it; dennunzio@disco.unimib.it; farina@disco.unimib.it
Fabio Farina
Affiliation:
Dipartimento di Informatica, Sistemistica e Comunicazione, Università degli Studi di Milano–Bicocca, via Bicocca degli Arcimboldi 8, 20126 Milano, Italy; cattang@disco.unimib.it; dennunzio@disco.unimib.it; farina@disco.unimib.it
Get access

Abstract

The main goal of this paper is the investigation of a relevantproperty which appears in the various definition of deterministictopological chaos for discrete time dynamical system:transitivity. Starting from the standard Devaney's notion of topological chaosbased on regularity, transitivity, and sensitivity to the initialconditions, the critique formulated by Knudsen is taken intoaccount in order to exclude periodic chaos from this definition.Transitivity (or some stronger versions of it) turns out to be therelevant condition of chaos and its role is discussed by a surveyof some important results about it with the presentation of somenew results. In particular, we study topological mixing, strong transitivity,and full transitivity. Their applications to symbolic dynamics areinvestigated with respect to the relationships with the associatedlanguages.

Information

Type
Research Article
Copyright
© EDP Sciences, 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable