Grammatical Complexity and One-Dimensional Dynamical Systems
From MaRDI portal
Publication:4978313
DOI10.1142/2877zbMath1368.58001OpenAlexW2479660560MaRDI QIDQ4978313
Publication date: 9 August 2017
Full work available at URL: https://doi.org/10.1142/2877
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to global analysis (58-02) Automata sequences (11B85)
Related Items
The relationships of three elementary cellular automata ⋮ A NOTE ON FRACTALS OF ONE FORBIDDEN WORD AND THEIR BOX DIMENSIONS ⋮ Entropy invariants. I: The universal order relation of order-preserving star products. ⋮ Computable symbolic dynamics ⋮ Grammatical complexity of one-dimensional maps with multiple monotone intervals ⋮ A complexity analysis of the elementary cellular automaton of rule 122 ⋮ Dual star products and symbolic dynamics of Lorenz maps with the same entropy ⋮ Finite automata for testing composition-based reconstructibility of sequences ⋮ Multiformity of inherent randomicity and visitation density in \(n\) symbolic dynamics ⋮ Effective Symbolic Dynamics ⋮ Composition law of cardinal ordering permutations ⋮ Fuzzy \(L\) languages ⋮ The plateau phenomenon in the topological entropy of the gap-tent map ⋮ Fractals related to long DNA sequences and complete genomes ⋮ "MIDDLE" PERIODIC ORBIT AND ITS APPLICATION TO CHAOS CONTROL ⋮ Dimensions of fractals related to languages defined by tagged strings in complete genomes ⋮ Complexity analysis of time series generated by elementary cellular automata ⋮ Inherent randomicity in 4-symbolic dynamics
