On the Computation of the Topological Entropy of Artificial Grammars

Abstract

Based on a proposal by \textcite {WarSch2015}, we provide a simple script in the R programming language for the computation of the topological entropy (TE) from transition matrices created from their ``subscripted element technique'' as a measure of the complexity of artificial grammars. We include a set of conventions for the transcription of grammar directed graphs to transition matrices that should provide for the consistent computation of the TE of artificial grammars.

Keywords

• complexity
• artificial grammars
• topological entropy
• r