We observe that any finite-state automaton can also be encoded as a hypergraph (in which every hyperedge is an ordinary edge that connects a single antecedent to a consequent).
the methods of this paper apply directly to the simpler case of hypothesis lattices as well.