Computations over finite monoids and their test complexity
From MaRDI portal
Recommendations
- Finite Monoids: From Word to Circuit Evaluation
- Circuits over monoids: A fault model, and a trade-off between testability and circuit delay
- The Complexity of Fault Detection Problems for Combinational Logic Circuits
- Complexity issues of checking identities in finite monoids
- scientific article; zbMATH DE number 1419259
Cites work
- scientific article; zbMATH DE number 4181296 (Why is no real title available?)
- scientific article; zbMATH DE number 3959293 (Why is no real title available?)
- A Regular Layout for Parallel Adders
- A design of programmable logic arrays with universal tests
- An easily testable optimal-time VLSI-multiplier
- Depth-size trade-offs for parallel prefix computation
- Design of Testable Structures Defined by Simple Loops
- On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests
- Parallel Prefix Computation
- Size-time complexity of Boolean networks for prefix computations
- Testing in two-dimensional iterative logic arrays
- The Complexity of Fault Detection Problems for Combinational Logic Circuits
Cited in
(8)- Finite Monoids: From Word to Circuit Evaluation
- Circuits over monoids: A fault model, and a trade-off between testability and circuit delay
- Finite basis problem for 2-testable monoids.
- scientific article; zbMATH DE number 4216027 (Why is no real title available?)
- THE COMPLEXITY OF DECIDING CODE AND MONOID PROPERTIES FOR REGULAR SETS
- Computable Følner monotilings and a theorem of Brudno
- Some remarks on the test complexity of iterative logic arrays (extended abstract)
- Complexity results on the conjugacy problem for monoids
This page was built for publication: Computations over finite monoids and their test complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1178692)
