Skip to main content
SpringerLink
Log in

Circuiti autonomi nonsingolari din elementi binari, realizzabili medianten elementi a soglia

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

The linear separability concepts are applied in order to give either necessary or sufficient conditions for realizability by exactlyn threshold elements of a given coded cycle set of an autonomous nonsingular sequential circuit, specified byn boolean functions. Two main classes are obtained, the self-dual and the pure majority classes corresponding respectively to a necessary and to a sufficient condition. Also “necklace” circuits are described which exhibit remarkable properties. The number ofrealizable, non singular autonomons circuits are enumerated up ton=5, and one investigates also the capability of circuits ofn threshold elements to perform a state cycle of length2 n. Finally, in Appendix I, a constructive method to generate a non singular transition table is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Bibliografia

  1. Calaniello, E. R., “Outline of a theory of thought processes and thinking machines”, J. of Theor. Biol.2, 204–235 (1961).

    Article  Google Scholar 

  2. Elgot, C. C., “Truth Functions Realizable by Single Threshold Organs” A.I.E.E. Conf. Paper no. 60-1311 (1960).

  3. Winder, O. R., “Single Stage Threshold Logic”, A.I.E.E. Conf. Paper no. 60-1261 (1960) and Ph. D. dissertation Princeton (1962).

  4. Ashby, W. R., Von Forster, H. andWalker, C. C.,Threshold and Stability in large networks., Techn. Rept. no. 3 Elec. Eng Res. Lab.-University of Illinois, (1962).

  5. Smith, D. R. andDavidson, C. H., “Maintened activity in neural nets”, J. ACM9, 268 (1962).

    Article  MATH  MathSciNet  Google Scholar 

  6. Gambardella, G. andTrautteur, G., “Experimental Observations on a small active network”, Kybernetik3, 8–13 (1966).

    Article  Google Scholar 

  7. Kautz, W. H., “State Logic Relations in Autonomous Sequential Networks” Proc. E.J.C.C. 119–127 (1958).

  8. Krohn, K, andRhodes, J., “Nets of threshold elments”, Inf. Control8, 579–588 (1965).

    Article  MATH  MathSciNet  Google Scholar 

  9. Drago, A., “Anti-Dual logical functions” Calcolo3, 1–4 (1966).

    Article  MATH  MathSciNet  Google Scholar 

  10. Miller, R. E., “Switching Theory”, vol. 1, p. 304, J. Wiley Inc., N. Y. (1965).

    Google Scholar 

  11. Wang, K. C., “Transition graphs of affine transformations on vector spaces over finite fields”, preprint (1966).

  12. Riordan, J., “An introduction to combinatorial analysis”, J. Wiley (1958) p. 162.

  13. Elspas, B., “The Theory of autonomous linear sequential networks”, IRE Trans. on Circuit Theory. CT-6, pp. 45–60 (1959).

    Google Scholar 

  14. Elspas, B., “Self-complementary symmetry types of Boolean functions”, IRE Trans. on Electronic computers, pp. 264–266 (1960).

  15. Slepian, D. “On the number of symmetry types of Boolean functions of n variables”, Can. J. Math.5, 185–193 (1953).

    MATH  MathSciNet  Google Scholar 

  16. Drago, A., “Rules to find the partition of n with maximum l.c.m.”, (in corso di stampa).

Download references

Author information

Authors and Affiliations

  1. Gruppo di Cibernetica del C.N.R., Istituto di Fisica Teorica dell'Università di Napoli, Napoli, Italy

    C. Crocchiolo & A. Drago

Authors
  1. C. Crocchiolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Drago
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Questa ricerca è stata finanziata in parte dall' U.S.A.F. sotto il Grant n. 65-44 tramite l'European Office, Office of Aerospace Research-Brnxelles.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Crocchiolo, C., Drago, A. Circuiti autonomi nonsingolari din elementi binari, realizzabili medianten elementi a soglia. Calcolo 4, 91–105 (1967). https://doi.org/10.1007/BF02641646

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02641646

Search

Navigation