Anthony Ralston
Pages 459-460
A learning program has been written in BASIC to play four-player partnership dominoes. Because dominoes is a game of incomplete information, the program uses somewhat different principles of artificial intelligence from those …
Michael H. Smith
Pages 462-467
Petri nets are investigated as one method of modeling speed independent asynchronous circuits. A study of circuit realizations of Petri nets leads to a demonstration of their usefulness in modeling speed independent operation …
David Misunas
Pages 474-481
A. Mulawa, Marek Machura
Pages 482-483
Richard B. Goldstein
Pages 483-485
C. N. Liu, D. T. Tang
Page 485
Robert Piessens
Pages 486-487
Joel A. Richardson, J. L. Kuester
Pages 487-489
Richard P. Watkins
Pages 489-490
Richard M. De Morgan
Page 489
G. Andrejková, J. Vinař
Page 489
Albert J. Good
Page 490
Edward J. Williams
Page 490
J. G. Byrne
Page 490
There are two main purposes in this paper: first, clarification and extension of known results about computation of recursive programs, with emphasis on the difference between the theoretical and practical approaches; second, …
Zohar Manna, Stephen Ness, Jean Vuillemin
Pages 491-502
A well-formed program is defined as a program in which loops and if statements are properly nested and can be entered only at their beginning. A corresponding definition is given for a well-formed flowchart. It is shown that
…
W. W. Peterson, T. Kasami, N. Tokura
Pages 503-512
A generalization of AVL trees is proposed in which imbalances up to &Dgr; are permitted, where &Dgr; is a small integer. An experiment is performed to compare these trees with standard AVL trees and with balanced trees on the basis of …
Caxton C. Foster
Pages 513-517
A formal system is presented which abstracts the notions of data item, function, and relation. It is argued that the system is more suitable than set theory (or its derivatives) for the concise and accurate description of program …
B. J. MacLennan
Pages 468-474
