Some remarks on the test complexity of iterative logic arrays

DOI10.1007/3-540-55808-X_12zbMath1493.94068OpenAlexW1534339836MaRDI QIDQ5096825

Bernd Becker, Joachim Hartmann

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1992 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55808-x_12

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Fault detection; testing in circuits and networks (94C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computations over finite monoids and their test complexity
• Testability Conditions for Bilateral Arrays of Combinational Cells
• A Design of Programmable Logic Arrays with Universal Tests
• Optimal Synthesis of Arbitrary Switching Functions with Regular Arrays of 2-Input 1-Output Switching Elements

This page was built for publication: Some remarks on the test complexity of iterative logic arrays