Automata and Binary Decision Diagrams

Authors:
Jean-Francis Michon;Jean-Marc Champarnaud
Affiliations:
-;-
Venue:
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Year:
1998

Citing 7
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A maxmin problem on finite automata

Discrete Applied Mathematics
Finding the Optimal Variable Ordering for Binary Decision Diagrams

IEEE Transactions on Computers
Minimisation of acyclic deterministic automata in linear time

Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
On the OBDD-Representation of General Boolean Functions

IEEE Transactions on Computers
Efficient data structures for Boolean functions

Discrete Mathematics - Special issue: trends in discrete mathematics
Binary Decision Diagrams

IEEE Transactions on Computers

Minimizing variants of visibly pushdown automata

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.