Both theoretical and practical considerations motivate the repre sentation of objects as certain compositions of simpler ones. In the theory of automata this observation has led to the concepts of pro ducts and complete systems of automata. In the general form of the products of automata all the component automata are fed back to one another. With this very broad notion of products, the realization of automata with large numbers of states by means of compositions of basic components is a highly involved process; this increases the possibility of errors. In order to decrease the complexity of feedbacks, a hierarchy of products called lXi-pro ducts was introduced some 10 years ago, where i runs over the set of all non-negative integers. In an IXcproduct the index set of the component automata is linearly ordered. The input of each automaton in the product may depend on the states of all automata preceding it, i. e., all component automata steer all those automata which follow them in the product. Furthermore, at most the next i-I automata (including itself) may be fed back to the input of a given component automaton. Thus for iXcproducts the lengths of feedbacks are at most i. The aim of this monograph is to give a systematic account of iXi-Products. It consists of five chapters, a reference section, and an index. The first chapter contains the necessary concepts and results from universal algebra, automata, and sequential machines."

This volume constitutes the proceedings of the 22nd Interna- tional Colloquium on Automata, Languages, and Programming, held under the sponsorship of EATCS in Szeged, Hungary in July 1995.
The volume presents four invited papers and 53 full revised research papers selected from a total of 111 submissions. ICALP traditionally covers the whole area of theoretical computer science; among the topics addressed in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.

This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.