Can a statement be made about the size of these diagrams w.r.t. the size of an implementation in e.g. Haskell?

For example, can these diagrams "blow up exponentially" like deterministic finite automata do w.r.t. their source regular expressions?