Show simple item record

dc.contributor.advisorChairperson, Graduate Committee: Jaroslaw Kwapiszen
dc.contributor.authorBuhanan, David Bryanten
dc.date.accessioned2013-06-25T18:39:30Z
dc.date.available2013-06-25T18:39:30Z
dc.date.issued2012en
dc.identifier.urihttps://scholarworks.montana.edu/xmlui/handle/1/1008en
dc.description.abstractIn this thesis we examine the class of cocyclic subshifts. First, we give a method of modeling the zeros of Diophantine equations in the multiplication of matrices. This yields many examples, and a proof that there is no algorithm than can decide if two cocyclic subshifts are equal. Next, we use the theory of finite dimensional algebras to give an algebraic technique for finding connecting orbits between topologically transitive components of a given cocyclic subshift. This gives a very complete picture of the structure of the dynamical system associated to the cocyclic subshift. Last, we characterize the languages of cocyclic subshifts via cocyclic automata, in an analogous manner to the characterization of the languages of sofic subshifts which have languages accepted by finite automata. Our automaton definition is closely related to definitions in the field of quantum computation.en
dc.language.isoenen
dc.publisherMontana State University - Bozeman, College of Letters & Scienceen
dc.subjectCocyclic subshiftsen
dc.subject.lcshDiophantine equationsen
dc.titleOn some aspects of cocyclic subshifts, languages, and automataen
dc.typeDissertationen
dc.rights.holderCopyright 2012 by David Bryant Buhananen
thesis.catalog.ckey1954830en
thesis.degree.committeemembersMembers, Graduate Committee: Marcy Barge; Lukas Geyer; Tomas Gedeon; Mark C. Pernarowski; Barry J. Jacobsenen
thesis.degree.departmentMathematical Sciences.en
thesis.degree.genreDissertationen
thesis.degree.namePhDen
thesis.format.extentfirstpage1en
thesis.format.extentlastpage125en


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


MSU uses DSpace software, copyright © 2002-2017  Duraspace. For library collections that are not accessible, we are committed to providing reasonable accommodations and timely access to users with disabilities. For assistance, please submit an accessibility request for library material.