A Dynamic Programming Approach to Sequential Pattern Recognition

DOI10.1109/PGEC.1967.264725MaRDI QIDQ5574372zbMATH OpenFDO

Authors Donald L. Dietmeyer, Peter R. Schneider

Publication date 1967

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

zbMATH Keywords

multiple output switching functions

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)

Recommendations

• On Identification of Totally Symmetric Boolean Functions
• scientific article; zbMATH DE number 3869231
• scientific article; zbMATH DE number 3894982
• Generalized Reed-Muller forms as a tool to detect symmetries
• Permutation and phase independent Boolean comparison

Cited in

(7)

• Detection of Totally Symmetric Boolean Functions
• Conjugate symmetry
• On Detecting Total or Partial Symmetry of Switching Functions
• Minimal sets on propositional formulae. Problems and reductions
• On Identification of Totally Symmetric Boolean Functions
• Exploiting regularities for Boolean function synthesis
• Generalized Reed-Muller forms as a tool to detect symmetries

This page was built for publication: A Dynamic Programming Approach to Sequential Pattern Recognition

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