What people are saying - Write a review
We haven't found any reviews in the usual places.
ASSIGNING MEANINGS TO PROGRAMS
CORRECTNESS OF A COMPILER FOR ARITHMETIC EXPRESSIONS₂
CONTEXTFREE LANGUAGES AND TURING MACHINE COMPUTATIONS
COMPUTER ANALYSIS OF NATURAL LANGUAGES₁
THE USE OF COMPUTERS IN THE THEORY OF NUMBERS
A MACHINE CALCULATION OF A SPECTRAL SEQUENCE
NUMERICAL HYDRODYNAMICS OF THE ATMOSPHERE
THE CALCULATION OF ZEROS OF POLYNOMIALS AND ANALYTIC FUNCTIONS
MATHEMATICAL THEORY OF AUTOMATA
LINEARLY UNRECOGNIZABLE PATTERNS₁
algebra algorithm analysis applied assigned atoms automata theory automaton axioms bachelor base component binary calculation coefficients compiler complements complex symbol computation connected consider construct contains context-free grammar context-free languages corresponding cut-point decision problem defined denote derived phrase-marker elements equations equivalence example exists finite set flowchart G polynomials geometric given integers interpretation isolated cut-point iteration function latent clashes lemma lexical linear linguistics masks Math mathematical method natural languages node noun obtained operation perceptron phrase structure grammars phrase-marker polynomials predicate Predictive Analyzer probabilistic automata Proc procedure proof recursion regular events regular expressions result rewriting satisfy semantic definition semantic markers sentence sequence shown in Figure statement structural index subcategorization rules subset subtree surface grammar syntax terminal string terminal symbol theorem transformational grammar transformational rules translation tree true truth values truth-functionally unsatisfiable Turing machine undecidable variables vector verifiable
Page 217 - REFERENCES (1) WW Bledsoe and I. Browning, "Pattern Recognition and Reading by Machine," 1959 Proceedings of the Eastern Joint Computer Conference, 225-232.
Page 6 - An expression is either a term or a string of symbols consisting of a predicate symbol of degree ns 0 followed by n terms. A substitution component is any construct of the form v ->• t where v is a variable and t is a term different from v; v is called the variable of the substitution component v -> t and t is called the term (Hence v -+ v is not a substitution component for any variable v) . A substitution is a finite (possibly empty) set of substitution components with distinct lei'thand sides....