Henning Fernau:
Identification of Function Distinguishable Languages

We show how appropriately chosen functions
which we call {\em distinguishing\/}
can be used to make deterministic finite
automata backward deterministic. These ideas can be exploited
to design regular language classes identifiable
in the limit from positive samples.
Special cases of this approach are the well-known
$k$-reversible and terminal dis\-tin\-guish\-able languages.