Thumbnail
Access Restriction
Subscribed

Author Comstock, D. R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract In a note by Baker [1], a method is given for getting the limiting connectivity matrix, B, of a matrix whose entries are Boolean 0's and 1's. Harary [2] suggests determining An-1 since An-1 = An = ··· , where n is the order of the matrix. The purpose of this note is to give a method for determining An-1. The method is also applicable to finding the output matrix of a switching network as described in [3] and [4] where again An-1 = An = ··· , but A now has Boolean switching functions as entries instead of 0's and 1's.
Description Affiliation: Oregon State Univ., Corvallis (Comstock, D. R.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 7
Issue Number 1
Page Count 1
Starting Page 13
Ending Page 13


Open content in new tab

   Open content in new tab
Source: ACM Digital Library