The problem of load balancing on the hypercube is considered. A number of tokens are placed at the nodes and the goal is to redistribute them evenly throughout the network. Initially, each of the p nodes stores up to m tokens. A simple algorithm is presented, operating in /spl Oscr/(log p+m/spl middot/log log p) time on average.

The complexity of two finite-state models, optimizing transducers and counting automata " (1988). Retrospective Theses and Dissertations. Paper 8800. The most advanced technology has been used to photo­ graph and reproduce this manuscript from the microfilm master. UMI films the original text directly fi-om the copy submitted. Thus, some dissertation copies are in typewriter face, while others may be from a computer printer. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyrighted material had to be removed, a note will indicate the deletion. produced by sectioning the original, beginning at the upper left-hand comer and continuing from left to right in equal sections with small overlaps. Each oversize page is available as one exposure on a standard 35 mm slide or as a 17" x 23" black and white photographic print for an additional charge. Photographs included in the original manuscript have been reproduced xerographically in this copy. 35 mm slides or 6" X 9" black and white photographic prints are available for any photographs or illustrations appearing in this copy for an additional charge. Contact UMI directly to order. 1988 Signature was redacted for privacy.

We present an Ogden-type pumping lemma for nonterminal bounded languages.It is shown that these Ogden-type conditions are stronger than the classical-type pumping conditions for nonterminal bounded languages.However, we show that they are not sufficient.In fact, we construct counterexamples at various levels of the Chomsky hierarchy, each of which satisfies the conditions of our Ogden-type lemma.Résumé.-Une grammaire est dite bornée pour les non terminaux si tout mot qui dérive de Paxiome contient un nombre de non terminaux borné par un entier K. On démontre ici un lemme d'itération du type de celui d'Ogden pour les langages engendrés par ces grammaires; ce lemme améliore ceux déjà connus pour ces langages.Nous montrons toutefois qu'il ne constitue pas une condition suffisante en construisant des exemples de langages satisfaisant ce lemme, et pris dans chacune des classes de la hiérarchie de Chomsky.

We introduce a new class of programs, called Finite Relational Linear Programs (FRLP), capable of modeling simple data processing applications. We analyze these programs with respect to tradeoffs between features they possess including the problems of equivalence and optimization. Algorithmic solutions are given to the two latter problems and others. Extensions are discussed in which a (part of) algorithmic solvability is lost. A unifying concept for this and previous work is presented.

We thank the following people for pointing out errors and improvements: Lorand Ambrus-Lakatos, Pierpaolo Battigalli, Jean-Pierre Benôıt, Jim Bergin, Richard Boylan, Boudewijn P. de Bruin, Joel Cohen, Juan Dubra, Peter Forsyth, Haruo Imai, Christopher Kah, Karthik Kalyanaraman, Nicolas Klein, Fuhito Kojima, Vijay Krishna, Hui Li, Tsen Lim, Kin Chung Lo, Salvatore Modica, Robert Murphy, Yasuyuki Noguchi, Marc Pauly, Bezalel Peleg, Daniel Probst, Phil Reny, Al Roth, Dov Samet, Giora Slutzki, Lutz Veldman, Shmuel Zamir.