A Dynamic Programming Approach to Sequential Pattern Recognition
From MaRDI portal
Publication:5574372
DOI10.1109/PGEC.1967.264725zbMATH Open0183.18702MaRDI QIDQ5574372FDOQ5574372
Authors: Donald L. Dietmeyer, Peter R. Schneider
Publication date: 1967
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Recommendations
Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (94D10)
Cited In (7)
- 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
- Detection of Totally Symmetric Boolean Functions
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)