Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.

This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research. The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory. Part II investigates different concepts of weighted recognizability. Part III examines alternative types of weighted automata and various discrete structures other than words. Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.

Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.

This volume focuses on group theory and model theory with a particular emphasis on the interplay of the two areas. The survey papers provide an overview of the developments across group, module, and model theory while the research papers present the most recent study in those same areas. With introductory sections that make the topics easily accessible to students, the papers in this volume will appeal to beginning graduate students and experienced researchers alike. As a whole, this book offers a cross-section view of the areas in group, module, and model theory, covering topics such as DP-minimal groups, Abelian groups, countable 1-transitive trees, and module approximations. The papers in this book are the proceedings of the conference "New Pathways between Group Theory and Model Theory," which took place February 1-4, 2016, in Mulheim an der Ruhr, Germany, in honor of the editors' colleague Rudiger Goebel. This publication is dedicated to Professor Goebel, who passed away in 2014. He was one of the leading experts in Abelian group theory.

This book constitutes the refereed proceedings of the 8th International Conference on Algebraic Informatics, CAI 2019, held in Nis, Serbia, in June/July 2019. The 20 revised papers presented were carefully reviewed and selected from 35 submissions. The papers present research at the intersection of theoretical computer science, algebra, and related areas. They report original unpublished research and cover a broad range of topics from automata theory and logic, cryptography and coding theory, computer algebra, design theory, natural and quantum computation, and related areas.

This volume focuses on group theory and model theory with a particular emphasis on the interplay of the two areas. The survey papers provide an overview of the developments across group, module, and model theory while the research papers present the most recent study in those same areas. With introductory sections that make the topics easily accessible to students, the papers in this volume will appeal to beginning graduate students and experienced researchers alike. As a whole, this book offers a cross-section view of the areas in group, module, and model theory, covering topics such as DP-minimal groups, Abelian groups, countable 1-transitive trees, and module approximations. The papers in this book are the proceedings of the conference "New Pathways between Group Theory and Model Theory," which took place February 1-4, 2016, in Mulheim an der Ruhr, Germany, in honor of the editors' colleague Rudiger Goebel. This publication is dedicated to Professor Goebel, who passed away in 2014. He was one of the leading experts in Abelian group theory.

Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights. These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution. Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata. Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures. Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.

This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications. The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research. The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory. Part II investigates different concepts of weighted recognizability. Part III examines alternative types of weighted automata and various discrete structures other than words. Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.

Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.

This Festschrift is published in honor of Yuri Gurevich's 80th birthday. An associated conference, YuriFest 2020, was planned for May 18-20 in Fontainebleau, France, in combination with the 39th Journees sur les Arithmetiques Faibles also celebrating Yuri's 80th birthday. Because of the coronavirus situation, the conference had to be postponed, but this Festschrift is being published as originally planned. It addresses a very wide variety of topics, but by no means all of the fields of logic and computation in which Yuri has made important progress.