The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Previous papers have shown that for any given n-input synchronous sequential machine there exists a circuit realization in which the circuit consists of a finite number of identical copies of one module and in which the modules are interconnected in a uniform manner. This paper shows that additionally the signal fan-in to every module and the signal fan-out from every module and from the input can...
Some new techniques for finding minimal set of tests which detect faults in combinational logic networks are described. A systematic procedure which can be programmed on a digital computer is given. Moreover, a new approach to the design of fault detection experiments for sequential machines which takes into account the actual construction of the sequential network is described.
Despite the numerous threshold logic synthesis methods developed in the past decade, the logic designer is still handicapped by the technological independent characterization of these methods. Hence, it has long been the desire for the logic designer to have a simple, efficient threshold-logic synthesis method, analogous to conventional Boolean synthesis using ANDs, ORs, or combinations of ANDs and...
A new model of abstract automata is presented employing the concept of finite automata on a network. Each normal network n provided with a one-way input tape determines a family of languages nl. A representation theorem, analogous to the Chomsky-Schützenberger representation theorem for context free languages1, is proved for the class nl. One consequence is that nl is a principal full AFL generated...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.