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.
The "deadlock" problem is a logical problem which may occur in a system in which resources are shared among users. Deadlock is a situation in which two or more jobs cannot be completed because of conflicting resource requirements. In this paper we assume that advance information about future resource requirements of jobs is available. In particular, we assume that jobs are represented as...
The aim of this paper is not the establishment of new results, but the understanding, from a machine theoretic point of view, of results originally arrived at by algebraic means. A new criterion for series parallel irreducibility is given which makes no reference to underlying semigroups but involves only series parallel operations. Also, the irreducibility of prime counter machines is established...
The simultaneous use of delayed and undelayed versions of the internal variables permits the realization of normal fundamental mode circuits with less restricted state assignments than the usual single transition time state assignments. This paper is concerned with problems associated with these state assignments.
The computational power of 2-way pushdown automata with m additional counters (called mC-PDA) is investigated. It is shown that any multi-tape Turingmachine (with a two-way input tape) which accepts within time T(n), where n is the input length, can be simulated by a 3C-PDA whose counters are bounded by T(n) and that any such Turing machine can also be simulated by a 2C-PDA whose counters are bounded...
This paper deals with hazards on out-puts of combinational switching circuits for multiple input changes. Certain types of function hazards are defined and are shown to be impossible to eliminate with any logic realization. Also, an interrelation between static and dynamic function hazards is established. Hazards due to delays in the logic are defined and a method of elimination is given for both...
Complex behavior by machines can be achieved by either having a large number of very simple machines or by having a complex machine with which to start. Our primary interest in this paper was with the former. By considering the global behavior of a large number of the simplest of machines, the following results were shown: 1. An array of identical square cells each of which can exist in only four...
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.