Prefix Tree

A Prefix Tree Acceptor (PTA) is the standard initial representation for state-merging-based DFA inference. Algorithms such as

RPNI also begin by constructing a PTA from positive samples, then merging states.