A useful conversion of FSAs to FSRAs must minimize some combination of these parameters, and while it may be intractable in general, it can be practical in many special cases.
the case of finite languages (acyclic FSAs) is both of practical importance and -we conjecture -can result in good compaction.