I am doing an assignment for my Theory of Computation course. We are writing a function and I am having a hard time understanding what "highest" state means in the following context:
dfsa --- a DFSA
f --- from state for regular expression
t --- to state for regular expression
h --- highest state paths from f to t may pass through
I understand what $t$ and $f$ mean but, what does $h$ mean?
EDIT: More context:
def transition_to_regex(dfsa, f, t, h):
'''(DFSA, int, int, int) -> str
Return regular expression for strings that drive dfsa from state f to state
t with higheset intermediate state h.
States of the DFSA are non-negative integers.
dfsa --- a DFSA
f --- from state for regular expression
t --- to state for regular expression
h --- highest state paths from f to t may pass through
'''