A note on inferring uniquely terminating code languages
A subclass of linear languages, called uniquely terminating code linear languages (utCLL), is introduced, motivated by the study of Makinen (1997), and an inference algorithm for utCLL is provided. The algorithm is extended to a corresponding subclass of equal matrix languages. (C) 1999 Elsevier Science B.V. All rights reserved.
formal languages grammatical inference identification in the limit