On grammatical complexity of a class of attractors (Q1914592)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On grammatical complexity of a class of attractors |
scientific article; zbMATH DE number 892228
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On grammatical complexity of a class of attractors |
scientific article; zbMATH DE number 892228 |
Statements
On grammatical complexity of a class of attractors (English)
0 references
15 December 1996
0 references
By invoking the theory of automata and formal grammars connected with logical questions, the standard one-dimensional symbolic dynamics and kneading theory issue of Feigenbaum's universality is formulated as a problem of grammatical complexity. For the ``Feigenbaum attractor'' and the ``Feigenbaum attractors in windows'' a proof is given that their languages are not context-free, but context-sensitive ones.
0 references
bifurcations
0 references
universality
0 references
automata
0 references
formal grammars
0 references
symbolic dynamics
0 references
kneading theory
0 references
