We define a new subclass of regular languages, called uniquely termina
ting regular languages, which can be inferred from positive data. The
class of uniquely terminating regular languages and the previously kno
wn subclasses of regular languages inferable from positive data are in
comparable. (C) 1997 Elsevier Science B.V.