𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On minimal covering of incompletely specified sequential networks

✍ Scribed by Tse-Yun Feng

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
698 KB
Volume
292
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

✦ Synopsis

In

this paper we describe a simpb procedure using &zaselli and ~ccio's concept to Jind a minimum-state cover. Their concept ie then extended to include a new class of p&nx compatibles 80 that a minimal cover can be found. Finally a complete procedure ie described to Jind both the minimum-state and the minimal covers.

πŸ“œ SIMILAR VOLUMES

Minimizing the effects of parameter devi
Minimizing the effects of parameter deviations on cellular neural networks
✍ Tetzlaff, R.; Kunz, R.; Wolf, D. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 299 KB πŸ‘ 3 views

The sensitivity of cellular neural networks (CNN) against random parameter deviations is discussed in detail. For di erent CNN with erroneous parameters the probability is estimated that all cell outputs converge to the same stable ΓΏxpoint of the corresponding error free CNN. These results are compa

On reliability evaluation of a capacitat
On reliability evaluation of a capacitated-flow network in terms of minimal pathsets
✍ Jsen-Shung Lin; Chin-Chia Jane; John Yuan πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 648 KB

Many real-world systems such as electric power transmission and distribution systems, transportation systems, and manufacturing systems can be regarded as flow networks whose arcs have independent, finite, and multivalued random capacities. Such a flow network is indeed a multistate system with mult

Further results on the maximum size of a
Further results on the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size
✍ I. Adamczak; D. L. Kreher; A. C. H. Ling; R. S. Rees πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 192 KB πŸ‘ 1 views

## Abstract Kreher and Rees 3 proved that if __h__ is the size of a hole in an incomplete balanced design of order Ο… and index Ξ» having minimum block size $k \ge t+1$, then, They showed that when __t__ = 2 or 3, this bound is sharp infinitely often in that for each __h__ β‰₯ __t__ and each __k__ β‰₯ _