A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
Data Structures and Algorithms
2024-04-16 v1 Databases
Formal Languages and Automata Theory
Abstract
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.
Cite
@article{arxiv.2404.09674,
title = {A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata},
author = {Antoine Amarilli and Marcelo Arenas and YooJung Choi and Mikaël Monet and Guy Van den Broeck and Benjie Wang},
journal= {arXiv preprint arXiv:2404.09674},
year = {2024}
}
Comments
26 pages