Switching and Finite Automata Theory: Frontmatter

[1]  J. Rodriguez,et al.  Problem (2) , 1994 .

[2]  Eugen Reichel,et al.  1. A - C , 1909 .

[3]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[4]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[5]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[6]  Thomas P. Minka,et al.  Gates , 2008, NIPS.

[7]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[8]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[9]  Thomas C. Bartee,et al.  Computer Design of Multiple-Output Logical Networks , 1961, IRE Trans. Electron. Comput..

[10]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[11]  E. W. Veitch,et al.  A chart method for simplifying truth functions , 1952, ACM '52.

[12]  J. Rodriguez,et al.  Problem (1) , 1994 .

[13]  Shimon Even,et al.  On Minimal Modulo 2 Sums of Products for Switching Functions , 1967, IEEE Trans. Electron. Comput..

[14]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[15]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[16]  I. Koren.  Computer arithmetic algorithms , 2018 .