论文标题
有限的半群识别的语言及其对树木和图形等对象的概括，重点是Monadic二阶逻辑的可确定性
Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic
论文作者
论文摘要
这些是关于普通语言代数方法的讲义。经典的代数方法是有限词。它使用半群而不是自动机。但是，代数方法可以扩展到超出单词的结构，例如〜无限单词或树或图。本书的目的是用涵盖这些扩展的方式来描述代数方法。
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond words, e.g.~infinite words, or trees or graphs. The purpose of this book is to describe the algebraic approach in a way that covers these extensions.
