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.
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.
Some properties of multiprocessing systems, i.e. computing systems in which a set of computational elements share a pool of storage elements are investigated. In particular, the conditions for the output-functionality of these systems are studied, where a computing systems is defined as being output-functional when it produces the same sequence of outputs for the same program, initial state, and input...
This paper continues investigations pertaining to recursive bounds on computing resources (such as time or memory) and the amount by which these bounds must be increased if new computations are to occur within the new bound. The paper proves that no recursive operator can increase every recursive bound enough to reach new computations. In other words, given any general recursive operator F[ ], there...
A superAFL is a family of languages closed under union with unitary sets, intersection with regular sets, and nested iterated substitution and containing at least one nonunitary set. Every superAFL is a full AFL containing all context-free languages. If L is a full principal AFL, then S∞(L, the least superAFL containing L, is full principal. If L is not substitution closed, the substitution closure...
A pushdown table machine can be simulated by a computer in time n log log n where n is the number of table machine operations. A finite state table machine can be simulated in linear time.
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.