Algebraic method for generation of locally trivial tests

zbMATH Open0708.94027MaRDI QIDQ920941

E. I. Mazur

Publication date: 1989

Published in: Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

linear feedback shift registercombinational circuitshardware complexitytest generator

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Zero testing of algebraic functions 👍 👎
• Recursive generation of locally complete tests 👍 👎
• A POLYNOMIAL TIME ALGORITHM FOR LOCAL TESTABILITY AND ITS LEVEL 👍 👎
• A polynomial time algorithm for the local testability problem of deterministic finite automata 👍 👎
• A probabilistic algorithm to test local algebraic observability in polynomial time 👍 👎
• A probabilistic algorithm to test local algebraic observability in polynomial time 👍 👎
• A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification 👍 👎

This page was built for publication: Algebraic method for generation of locally trivial tests

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