Intended for graduate students and advanced undergraduates in computer science, A
Second Course in Formal Languages and Automata Theory treats topics in the theory of …

Graph algebras possess the capacity to relate fundamental concepts of computer science,
combinatorics, graph theory, operations research, and universal algebra. They are used to …

We extend a classic result of Büchi, Elgot, and Trakhtenbrot: MSO definable string
transductions ie, string-to-string functions that are definable by an interpretation using …

This collaborative volume presents recent trends arising from the fruitful interaction between
the themes of combinatorics on words, automata and formal language theory, and number …

Interest in finite automata theory continues to grow, not only because of its applications in
computer science, but also because of more recent applications in mathematics, particularly …

We present a computational framework for automatic synthesis of control and
communication strategies for a robotic team from task specifications that are given as regular …

Finite automata are probably best known for being equivalent to right-linear context-free
grammars and, thus, for capturing the lowest level of the Chomsky-hierarchy, the family of …

Research on information extraction from Web pages (wrapping) has seen much activity
recently (particularly systems implementations), but little work has been done on formally …

An intrinsic part of information extraction is the creation and manipulation of relations
extracted from text. In this article, we develop a foundational framework where the central …

Mathematical Foundations of Automata Theory Page 1 Mathematical Foundations of Automata
Theory Jean-Éric Pin Version of February 18, 2022 Page 2 Page 3 Preface These notes form …