This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of their variants studied in the setting of knowledge compilation. Last, it explains how these formalisms can be connected to the notions of automata over words and trees.

中文翻译：

---

电路马戏团：决策图、电路和自动机之间的联系

本文档介绍了定义布尔函数的两种相关形式：二元决策图和布尔电路。它介绍了这些形式主义及其在知识汇编背景下研究的几种变体。最后，它解释了这些形式主义如何与单词和树上的自动机概念联系起来。