Ebook: 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.

---

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.

---

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.
Content:
Front Matter....Pages i-xxii
Profinite semigroups and applications....Pages 1-45
The structure of free algebras....Pages 47-76
Completeness of automaton mappings with respect to equivalence relations....Pages 77-108
Completeness of uniformly delayed operations....Pages 109-147
Classification in finite model theory: counting finite algebras....Pages 149-158
Syntactic semigroups and the finite basis problem....Pages 159-167
Endoprimal algebras....Pages 169-180
The complexity of constraint satisfaction: an algebraic approach....Pages 181-213
On the automata functional systems....Pages 215-240
Algebra of behavior transformations and its applications....Pages 241-272
Congruence modular varieties: commutator theory and its uses....Pages 273-329
Epigroups....Pages 331-380
Algebraic classifications of regular tree languages....Pages 381-432
Back Matter....Pages 433-434

---

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.
Content:
Front Matter....Pages i-xxii
Profinite semigroups and applications....Pages 1-45
The structure of free algebras....Pages 47-76
Completeness of automaton mappings with respect to equivalence relations....Pages 77-108
Completeness of uniformly delayed operations....Pages 109-147
Classification in finite model theory: counting finite algebras....Pages 149-158
Syntactic semigroups and the finite basis problem....Pages 159-167
Endoprimal algebras....Pages 169-180
The complexity of constraint satisfaction: an algebraic approach....Pages 181-213
On the automata functional systems....Pages 215-240
Algebra of behavior transformations and its applications....Pages 241-272
Congruence modular varieties: commutator theory and its uses....Pages 273-329
Epigroups....Pages 331-380
Algebraic classifications of regular tree languages....Pages 381-432
Back Matter....Pages 433-434
....