On grammatical complexity of a class of attractors

DOI10.1007/BF00122312zbMath0852.58062OpenAlexW2092104899MaRDI QIDQ1914592

Qinhe Lu

Publication date: 15 December 1996

Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00122312

zbMATH Keywords

automatabifurcationssymbolic dynamicsuniversalitykneading theoryformal grammars

Mathematics Subject Classification ID

Attractors and repellers of smooth dynamical systems and their topological structure (37C70) Automata and formal grammars in connection with logical questions (03D05) Low-dimensional dynamical systems (37E99)

Cites Work

• Quantitative universality for a class of nonlinear transformations
• A helpful result for proving inherent ambiguity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On grammatical complexity of a class of attractors