The Production of Completion Signals by Asynchronous, Iterative Networks

DOI10.1109/PGEC.1964.263775zbMATH Open0163.25803OpenAlexW2066128851MaRDI QIDQ5547604FDOQ5547604

Authors: F. Mileto, Gianfranco R. Putzolu 

Publication date: 1964

Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/pgec.1964.263775

zbMATH Keywords

languages, automata, networks

Cited In (6)

• Characteristic measures of switching functions
• Algebraic nonlinearity and its applications to cryptography
• Estimation of the length and the number of dead-end disjunctive normal forms for almost all partial Boolean functions
• Nombre moyen de majorants d'une fonction Booléenne incomplète. Remarques concernant le nombre moyen de monômes premiers
• A new lower bound on the expected size of irredundant forms for Boolean functions
• Nondegenerate functions and permutations

This page was built for publication: The Production of Completion Signals by Asynchronous, Iterative Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5547604)