Minimization of the number of leads to universal boolean networks

dc.contributor.author	Winkler, William Tonn, 1942-
dc.creator	Winkler, William Tonn, 1942-	en
dc.date.accessioned	2015-04-01T13:34:28Z	en
dc.date.available	2015-04-01T13:34:28Z	en
dc.date.issued	1969	en
dc.identifier.uri	http://hdl.handle.net/10150/347674	en
dc.language.iso	en_US	en
dc.publisher	The University of Arizona.	en
dc.rights	Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.	en
dc.subject	Logic machines.	en
dc.subject	Algebra, Boolean.	en
dc.title	Minimization of the number of leads to universal boolean networks	en
dc.type	text	en
dc.type	Thesis-Reproduction (electronic)	en
dc.identifier.oclc	30067223	en
thesis.degree.grantor	University of Arizona	en
thesis.degree.level	masters	en
thesis.degree.discipline	Electrical Engineering	en
thesis.degree.discipline	Graduate College	en
thesis.degree.name	M.S.	en
dc.description.note	This item was digitized from a paper original. If you need higher-resolution images for any content in this item, please contact us at repository@u.library.arizona.edu.	en
dc.identifier.bibrecord	.b3144023x	en
dc.identifier.callnumber	E9791 1969 256	en
dc.description.admin-note	Original file replaced with corrected file April 2023.
refterms.dateFOA	2018-07-18T01:57:47Z

Name:

AZU_TD_BOX152_E9791_1969_256_c.pdf

Size:

7.206Mb

Format:

PDF