A follow up to my earlier post, CUDD C++ Interface for converting Booleans to BDDs and resulting set of minterms (to cutsets).
In the tulip-dd BDD lib., which runs on Python, one can define and read Boolean expressions as strings. That makes the whole I/O process very convenient .
Now, we just saw in the prior post that using the cudd C++ interface we can define a Boolean expression conveniently using a compact math notation such as x1*x2 + x3*x4and how to produce the sum of minterms from that expression. But does cudd also allow us to use strings for the Boolean expressions? I suspect not, and if not, I would have to find a way to convert the string equivalent of the sum product above to the equivalent Boolean: "x1*x2+x3*x4"to x1*x2+x3*x4.