In particular, decision trees can be converted into implicational rules that an expert could inspect and can in principle be compiled back into finite-state machines (Sproat and Riley, 1996), although that would re-introduce the original efficiency problems.
finite-state transducers have the advantage of being invertible, which can be exploited e. g. for testing hand-crafted rule sets.