Inductive construction from an expression
I would like to be able to translate an expression into an automaton exclusively by using algorithms on automata. For instance E.F
calls the multiply
algorithm on the translation of E
and F
. Etc.
This should provide us with some means to exercise thoroughly derived_terms for instance.