Inferring regular languages by merging nonterminals

Abstract

Several subclasses of regular languages are known to be inferable from positive data only. This paper surveys classes of languages originating from the class of reversible languages. We define the classes by using a uniform grammatical notation.

Keywords:

• Regular language
• grammatical inference
• identification in the limit
• merging

C.R. Categories:

• F.4.2
• F.4.3
• I.2.6