These hierarchic regular expressions are defined to resemble expansion rules in a context free grammar (CFG).
unlike CFGs, HHMMs have memory limits on nesting, in the form of a maximum depth D beyond which no expansion may take place.