Applied computation theory : analysis, design, modeling / Raymond T. Yeh, editor.
— Englewood Cliffs, N.J. : Prentice-Hall, c1976. xiii, 624 p. : il. ; 24 cm. — (Prentice-Hall series in automatic computation)
Incluye referencias bibliográficas e índice.
Contenido: Part I. Background: Raymond T. Yeh, A brief introduction to the theory of automata and formal languages.
Contenido: Part II. Analysis: Eugene Lawler, Introduction to the complexity of algorithms — C. L. Liu, A combinatorial study of some scheduling algorithms — K. S. Fu, Linguistic approach to pattern recognition — R. K. Guha and R. T. Yeh, A formalization and analysis of simple list structures.
Contenido: Part III. Design: Alfred V. Aho, Language theory in compiler design — Terrence W. Pratt, Application of formal grammars and automata to programming language definition — C. V. Ramamoorthy and R. C. Cheung, Designs of fault-tolerant computing systems — David W. Matula, Radix arithmetic: digital algorithms for computer architecture.
Contenido: Part IV. Modeling: Terry Winograd, Parsing natural language via recursive transition net — David Waltz, Automata theoretical approach to visual information processing — Gabor T. Herman, Using formal language theory to model biological processes — Bruce H. Barnes, An automata theoretic approach to interactive computer graphics command languages — John Howard, Modeling operating systems with automata.
Contenido: Appendix I. Description of course: introduction of the theory of automata and formal language — Appendix II. Description of course: design principles of programming languages and compilers — Appendix III. Description of course: design principles of fault-tolerant computing systems.
ISBN 0130393053
|