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.
In this paper, we have introduced a new style of formal grammars called String Adjunct Grammars (AG). The rules in an AG have a considerably different formal character as compared to the 'rewrite rule' in a Phrase Structure Grammar (PSG). Such a study of formal grammars of different styles (i.e., formal character of rules) is of great interest because each style is well suited for characterizing certain...
The stochastic sequential machine is invariably treated as the stochastic extension of the completely-specified deterministic machine. This paper investigates the incompletely-specified finite-state stochastic sequential machine from the viewpoint of machine equivalence and reduction. Definitions are chosen and procedures developed so that they reduce to the conventional froms in the special cases...
The problem of assigning a probability to each string of a language L(G) generated by a grammar G is considered. Two methods are considered. One method assigns a probability to each production associated with G and the other assigns the probabilities on the basis of particular features of the language. Several necessary conditions that must be satisfied by these probability assignment techniques if...
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.