Fixed bugs in Courcelle downward closure. Downward closures (both via
derivation trees and Courcelle) now fully support arbitrary regular
expressions as constants in the grammars they are supplied -
intersection between such a grammar and an FA does NOT work, however.
Only use grammars where the monomials are strings over (T union N) where
T is the terminal alphabet and N is the nonterminal alphabet.