This dictionary supplies associations which have been evoked by certain words, signs, etc. in Western civilization in the past, and which may float to the surface again tomorrow; for however 'daringly new' a modern use of imagery may look, it generally appears to have roots in what has been said and done in the past. No fine distinctions have been made between symbols (in the limited sense), allegories, metaphors, signs, types, images, etc. (not to mention 'ascending' and 'descending' symbols), since such subtle distinctions, however sensible from a scientific point of view, are useless to a person struggling with the deeper comprehension (and thus appreciation) of a particular 'symbol'.

The Encyclopaedia of Mathematics is the most up-to-date, authoritative and comprehensive English-language work of reference in mathematics which exists today. With over 7,000 articles from `A-integral' to `Zygmund Class of Functions', supplemented with a wealth of complementary information, and an index volume providing thorough cross-referencing of entries of related interest, the Encyclopaedia of Mathematics offers an immediate source of reference to mathematical definitions, concepts, explanations, surveys, examples, terminology and methods. The depth and breadth of content and the straightforward, careful presentation of the information, with the emphasis on accessibility, makes the Encyclopaedia of Mathematics an immensely useful tool for all mathematicians and other scientists who use, or are confronted by, mathematics in their work. The Enclyclopaedia of Mathematics provides, without doubt, a reference source of mathematical knowledge which is unsurpassed in value and usefulness. It can be highly recommended for use in libraries of universities, research institutes, colleges and even schools.

This book constitutes the refereed proceedings of the 13th International Conference on Language and Automata Theory and Applications, LATA 2019, held in St. Petersburg, Russia, in March 2019. The 31 revised full papers presented together with 5 invited talks were carefully reviewed and selected from 98 submissions. The papers cover the following topics: Automata; Complexity; Grammars; Languages; Graphs, trees and rewriting; and Words and codes.

The author, who died in 1984, is well-known both as a person and through his research in mathematical logic and theoretical computer science. In the first part of the book he presents the new classical theory of finite automata as unary algebras which he himself invented about 30 years ago. Many results, like his work on structure lattices or his characterization of regular sets by generalized regular rules, are unknown to a wider audience. In the second part of the book he extends the theory to general (non-unary, many-sorted) algebras, term rewriting systems, tree automata, and pushdown automata. Essentially Büchi worked independent of other rersearch, following a novel and stimulating approach. He aimed for a mathematical theory of terms, but could not finish the book. Many of the results are known by now, but to work further along this line presents a challenging research program on the borderline between universal algebra, term rewriting systems, and automata theory. For the whole book and again within each chapter the author starts at an elementary level, giving careful explanations and numerous examples and exercises, and then leads up to the research level. In this way he covers the basic theory as well as many nonstandard subjects. Thus the book serves as a textbook for both the beginner and the advances student, and also as a rich source for the expert.

For over half a century, Boris (Boaz) Trakhtenbrot has made seminal contributions to virtually all of the central areas of theoretical computer science. This festschrift volume readily illustrates the profound influence he has had on the field.

This volume presents the proceedings of the workshop CSL '91 (Computer Science Logic) held at the University of Berne, Switzerland, October 7-11, 1991. This was the fifth in a series of annual workshops on computer sciencelogic (the first four are recorded in LNCS volumes 329, 385, 440, and 533). The volume contains 33 invited and selected papers on a variety of logical topics in computer science, including abstract datatypes, bounded theories, complexity results, cut elimination, denotational semantics, infinitary queries, Kleene algebra with recursion, minimal proofs, normal forms in infinite-valued logic, ordinal processes, persistent Petri nets, plausibility logic, program synthesis systems, quantifier hierarchies, semantics of modularization, stable logic, term rewriting systems, termination of logic programs, transitive closure logic, variants of resolution, and many others.