Complex systems, complexity measures, grammars and model-inferring

DOI10.1016/0960-0779(94)90072-8zbMath0813.68101OpenAlexW2065972429MaRDI QIDQ1331210

B. Schapiro, Peter Wagner, Ralf Günther

Publication date: 21 August 1994

Published in: Chaos, Solitons and Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0960-0779(94)90072-8

zbMATH Keywords

complexityuniversal measure

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Finite automata-models for the investigation of dynamical systems ⋮ SCALING BEHAVIOR AND COMPLEXITY OF THE PORTEVIN-LE CHATELIER EFFECT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation theory of cellular automata
• Toward a quantitative theory of self-generated complexity
• Efficient learning of context-free grammars from positive structural examples
• Word frequency and entropy of symbolic sequences: A dynamical perspective
• An approach to the physics of complexity
• An algebraic measure of complexity
• Universal coding, information, prediction, and estimation
• Probabilistic Properties of Deterministic Systems
• Approximate language identification
• Unpredictability and undecidability in dynamical systems
• Generalized shifts: unpredictability and undecidability in dynamical systems
• Language identification in the limit

This page was built for publication: Complex systems, complexity measures, grammars and model-inferring