Valery B. Kudryavtsev & Ivo G. Rosenberg 
Structural Theory of Automata, Semigroups, and Universal Algebra 
Proceedings of the NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra, Montreal, Quebec, Canada, 7-18 July 2003

Several of the contributions to this volume bring forward many mutually beneficial interactions and connections between the three domains of the title. Developing them was the main purpose of the NATO ASI summerschool held in Montreal in 2003. Although some connections, for example between semigroups and automata, were known for a long time, developing them and surveying them in one volume is novel and hopefully stimulating for the future. Another aspect is the emphasis on the structural theory of automata that studies ways to contstruct big automata from small ones. The volume also has contributions on top current research or surveys in the three domains. One contribution even links clones of universal algebra with the computational complexity of computer science. Three contributions introduce the reader to research in the former East block.

表中的内容

Profinite semigroups and applications.- The structure of free algebras.- Completeness of automaton mappings with respect to equivalence relations.- Completeness of uniformly delayed operations.- Classification in finite model theory: counting finite algebras.- Syntactic semigroups and the finite basis problem.- Endoprimal algebras.- The complexity of constraint satisfaction: an algebraic approach.- On the automata functional systems.- Algebra of behavior transformations and its applications.- Congruence modular varieties: commutator theory and its uses.- Epigroups.- Algebraic classifications of regular tree languages.