Characterization of Recursive Sets by Generators

Lemma: If L is recursive, then there is a generator for L that prints the words of L in canonical order. Converse If L is generated in canonical order, then L is recursive.

Does this work if L is finite?

L is regular an FA.