Skip to main content
Conference Proceedings

Automata and binary decision diagrams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1660 178-182
DOI: 10.1007/3-540-48057-9_15
2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.

Cite

CITATION STYLE

APA

Michon, J. F., & Champarnaud, J. M. (1999). Automata and binary decision diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1660, pp. 178–182). Springer Verlag. https://doi.org/10.1007/3-540-48057-9_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free