NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
Simplification of multiple-output Boolean functions using an extension of the directed search algorithm
| dc.contributor.advisor | Drew, Dan D. | |
| dc.contributor.advisor | Rhyne, V. Thomas | |
| dc.creator | Perkins, Sharon Ruth | |
| dc.date.accessioned | 2020-08-21T22:24:56Z | |
| dc.date.available | 2020-08-21T22:24:56Z | |
| dc.date.issued | 1980 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/DISSERTATIONS-655101 | |
| dc.description | Typescript (photocopy). | en |
| dc.description.abstract | The approach to minimization of multiple-output combinational systems considered in this study is based on the directed search algorithm that was designed for single-output system. Here the directed search algorithm is extended to minimize multiple-output systems. Unlike most minimization techniques, the algorithm in this study does not identify and select implicants in two separate operations, but rather, it identifies and selects implicants in a single operation. | en |
| dc.format.extent | vii, 77 leaves | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject | Major computing science | en |
| dc.subject.classification | 1980 Dissertation P451 | |
| dc.subject.lcsh | Algebra, Boolean | en |
| dc.subject.lcsh | Combinatorial analysis | en |
| dc.title | Simplification of multiple-output Boolean functions using an extension of the directed search algorithm | en |
| dc.type | Thesis | en |
| thesis.degree.grantor | Texas A&M University | en |
| thesis.degree.name | Doctor of Philosophy | en |
| thesis.degree.name | Ph. D | en |
| dc.contributor.committeeMember | Barnes, Jack | |
| dc.contributor.committeeMember | Sheppard, Sallie | |
| dc.type.genre | dissertations | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
| dc.publisher.digital | Texas A&M University. Libraries | |
| dc.identifier.oclc | 7146883 |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.