Solving the Wiener-Hopf Equation


Book Description

The Wiener-Hopf equation is briefly derived and the method of solving, which is believed easiest to use, is presented. The solution is then specialized for the case where the message and input spectral densities are rational functions.




On the Theory of Boolean Formulas


Book Description

The theory of substitutions for Boolean formulas developed in a previous report is applied here to the determination of those s-tuples of formulas that may be allowable replacements for s -tuples of sub-formulas of given Boolean formulas. The criteria of allowability are very general and flexible, yet may be expressed with great precision and ease. The results formalize and extend various known isolated instances. They may be used for the study of a large number of problems in the theory and application of Boolean formulas and functions.







Theory of Continuous Zone Refining Via the Zone-transport Method


Book Description

This paper explains the differences and the reasons for the differences which exist between the theory of the zone-transport system of continuous zone refining as presented by W. G. Pfann and T. Abe. The identity between the mathematical model used to describe the zone-transport system and one of the models used to describe the recently reported matter-transport system is noted. Nondimensional equations for the zone-transport system are presented and the difference between the limit of alpha in the zone-void and zonetransport systems, when L sub e = 0, is correlated. (Author).




The Paraboloid Mirror


Book Description










On the Relative Efficiencies of Context-free Grammar Recognizers


Book Description

A number of diverse recognition procedures that have been proposed for parsing sentences with respect to a context-free grammar are described in this paper by means of a common device. Each procedure is defined by giving an algorithm for obtaining a nondeterministic Turing Machine recognizer that is equivalent to a given context-free grammar. The formalization of the Turing Machine has been chosen to make possible particularly simple descriptions of the parsing procedures considered.