 |
|
What people are saying - Write a reviewWe haven't found any reviews in the usual places. Related books
Common terms and phrasesalgebra algorithm analysis applied assigned atoms automata theory automaton axioms bachelor base component binary calculation clauses coefficients complements complex symbol computation condition 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 polynomials predicate Predictive Analyzer probabilistic automata 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 theorem-proving transformational grammar transformational rules translation tree true truth values truth-functionally unsatisfiable Turing machine undecidable variables vector verifiable Popular passagesPage 217 - REFERENCES (1) WW Bledsoe and I. Browning, "Pattern Recognition and Reading by Machine," 1959 Proceedings of the Eastern Joint Computer Conference, 225-232. References to this bookFrom other books
From Google ScholarThe theory of parsing, translation, and compilingAlfred V Aho, Jeffrey D Ullman - 1972 - ACM Classic Books Series Essays in computing scienceCAR Hoare, CB Jones - 1989 - Prentice-Hall, Inc. Upper Saddle River, NJ, USA Mathematics and PsychologyGarrett Birkhoff - 1969 - SIAM Review Verifying Compilers and ASMsGerhard Goos, Wolf Zimmermann References from web pagesMathematical Aspects of Computer Science, Proc. IFIP Congress 77 ... MATHEMATICAL ASPECTS OF COMPUTER SCIENCE, Correctness Of A Compiler For Arithmetic Expressions - mccarthy ... Stanford Artificial tnteliigence Laboratory Memo AIM-228 Computer ... CURRICULUM VITAE Proving programs correct: Some techniques and examples @preamble{ "\def\oldpopl#1{{\it {Conf. Rec. #1 ACM Symposium on ... @String{jan = "January"} @String{feb = "February"} @String{mar ... Bibliographic information
|
