Because the decomposition automaton represents all the ways in which the input object can be built recursively out of smaller structures, including ones which will later be rejected by the grammar, such automata can be very large in practice.
we would like to work with a lazy representation of M R and avoid iterating over all rules.