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. / Graduation date: 2011
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/21588 |
| Date | 02 June 2011 |
| Creators | Wing, David Josiah |
| Contributors | Burton Jr, Robert M. |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0022 seconds