Zobrazeno 1 - 7
of 7
pro vyhledávání: '"77"'
Autor:
Victor J. Rayward-Smith
Publikováno v:
Journal of Computer and System Sciences. (1):130-149
A new class of generative grammars called hypergrammars is introduced. They are described as a natural extension of Fischer's macrogrammars. Three modes of derivation, inside-out, outside-in, and unrestricted are considered, and the classes of langua
Autor:
P.Brian Shay, Michael Aissen
Publikováno v:
Journal of Combinatorial Theory, Series A. (1):69-82
Autor:
Leonard Carlitz
Publikováno v:
Journal of Combinatorial Theory, Series A. (2):235-240
Sarmanov, Sevast'yanov, and Tarakanov have proved certain combinatorial identities by a combinatorial argument, namely, by counting the number of weighted chains by two different methods. The identities are applied to the summation of infinite series
Autor:
V. C. Mavron
Publikováno v:
Journal of Combinatorial Theory, Series A. (3):322-330
The structure of affine designs admitting all possible translations in one direction is investigated. A method is given for constructing such designs using Cartesian groups, analogous to the known method for affine planes.
Publikováno v:
Journal of Computer and System Sciences. (2):251-256
In “Monadic Computation and Iterative Algebraic Theories” Elgot [3] introduced the notion of a vector iterative theory and showed that vector iterative theories have a close connection with several aspects of the theory of computation. In private
Autor:
David C Rine
Publikováno v:
Journal of Combinatorial Theory, Series A. (1):1-16
This paper is a collection of four topics; they are: a discussion of two knapsack problems (see, for example, Gilmore and Gomory, 1966 ), some interesting heuristic remarks on computational experience, some remarks on the underlying algebraic structu
Autor:
Eugenio Calabi, Herbert S Wile
Publikováno v:
Journal of Combinatorial Theory, Series A. (1):107-109