Display options
Cite
Perry N, Binder PM. Finite statistical complexity for sofic systems. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics. 1999;60(1):459-63doi: 10.1103/physreve.60.459.
Perry, N., & Binder, P. M. (1999). Finite statistical complexity for sofic systems. Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics, 60(1), 459-63. https://doi.org/10.1103/physreve.60.459
Perry, N, and Binder, P M. "Finite statistical complexity for sofic systems." Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics vol. 60,1 (1999): 459-63. doi: https://doi.org/10.1103/physreve.60.459
Perry N, Binder PM. Finite statistical complexity for sofic systems. Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics. 1999 Jul;60(1):459-63. doi: 10.1103/physreve.60.459. PMID: 11969783.
Copy Download .nbib Format: NLM
Share it on

Phys Rev E Stat Phys Plasmas Fluids Relat Interdiscip Topics. 1999 Jul;60(1):459-63. doi: 10.1103/physreve.60.459.

Finite statistical complexity for sofic systems.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

N Perry, P M Binder

Affiliations

  1. Departamento de Física, Universidad de Los Andes, Apartado Aéreo 4976, Bogotá, Colombia.

PMID: 11969783 DOI: 10.1103/physreve.60.459

Abstract

We propose a measure of complexity for symbolic sequences, which is based on conditional probabilities, and captures computational aspects of complexity without the explicit construction of minimal deterministic finite automata (DFA). Moreover, if the sequence is obtained from a dynamical system through a suitable encoding and its equations of motion are known, we show how to estimate the regions of phase space that correspond to computational states with statistically equivalent futures (causal states).

Publication Types