Identification of Function Distinguishable Languages
Author: Henning Fernau.
Source: Lecture Notes in Artificial Intelligence Vol. 1968, 2000, 116 - 130.
Abstract. We show how appropriately chosen functions which we call 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 distinguishable languages.
©Copyright 2000 Springer