Graduate Thesis Or Dissertation
 

Notions of complexity in substitution dynamical systems

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/k930c1602

Descriptions

Attribute NameValues
Creator
Abstract
  • There has been a lot of work done in recent decades in the field of symbolic dynamics. Much attention has been paid to the so-called "complexity" function, which gives a sense of the rate at which the number of words in the system grow. In this paper, we explore this and several notions of complexity of specific symbolic dynamical systems. In particular, we compute positive entropy and state some k-balancedness properties of a few specific (random) substitutions. We also view certain sequences as subsets of Z², stating several properties and computing bounds on entropy in a specific example.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Rights Statement
Publisher
Peer Reviewed
Language
Replaces

Relationships

Parents:

This work has no parents.

In Collection:

Items