top banner top banner
index
RegularArticles
ReplicationStudies
Vignettes
EditorialBoard
Instructions4Authors
JournalGuidelines
Messages
Submission

Search publications

On the Computation of the Topological Entropy of Artificial Grammars

Full text PDF
Bibliographic information: BibTEX format RIS format XML format APA style
Cited references information: BibTEX format APA style
Doi: 10.20982/tqmp.16.4.p355

Vokey, John R. , Jamieson, Randall K.
355-362
Keywords: complexity , artificial grammars , topological entropy
Tools: R
(no sample data)   (no appendix)

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.


Pages © TQMP;
Website last modified: 2020-09-14.
Template last modified: 2019-03-03>.
Page consulted on .
Be informed of the upcoming issues with RSS feed: RSS icon RSS