Specification for IDFA

Variable Description
$ u_\tau $ The number of states without $\tau$-transitions.
$ n $ $\mid Q \mid$ the number of states of the minimal DFA
$ l $ $\mid F - \{ q_0\} \mid$ the number of states that are final but are not the initial state
$ k $ $|\Sigma|$ The number of symbols in the alphabet
$ itc(L) $ The incomplete transition complexity of a regular language L (itc(L)) is the minimal number of transitions of any DFA that accepts L.
$ f $ $f=|F|$