Characteristic polynomials of one-dimensional linear hybrid cellular automata

Show simple item record

dc.contributor.author Cattell, Kevin Michael
dc.date.accessioned 2018-06-12T22:36:00Z
dc.date.available 2018-06-12T22:36:00Z
dc.date.copyright 1995 en_US
dc.date.issued 2018-06-12
dc.identifier.uri https://dspace.library.uvic.ca//handle/1828/9439
dc.description.abstract A one-dimensional linear hybrid cellular automaton (CA) is a specialised form of linear finite state machine. These machines are of interest, both for their theoretical properties and for their applications in VLSI built-in-self-test, random number generation, cryptography, coding theory, and other areas. This work is a study of the algebraic properties of the characteristic polynomials of CA, primarily for machines defined over GF(2). Several problems, previously open, are solved: the efficient synthesis of a CA from an irreducible polynomial, the existence and uniqueness of CA for irreducible polynomials, the reducibility of the characteristic polynomial of a cyclic-boundary CA, and the form of a similarity transform between CA and linear feedback shift registers. A probabilistic algorithm for the synthesis of CA over finite fields other than GF(2) is presented. Various other results concerning the characteristic polynomial of CA are derived, and possible directions for future research are discussed. en_US
dc.language English eng
dc.language.iso en en_US
dc.rights Available to the World Wide Web en_US
dc.subject Cellular automata en_US
dc.title Characteristic polynomials of one-dimensional linear hybrid cellular automata en_US
dc.type Thesis en_US
dc.contributor.supervisor Muzio, Jon C.
dc.degree.department Department of Computer Science en_US
dc.degree.level Doctor of Philosophy Ph.D. en_US
dc.description.scholarlevel Graduate en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UVicSpace


My Account