Polynomial-Time Inference of Paralleled Even Monogenic Pure Context-Free Languages

摘要

We introduce a subclass of context-free lan- guages, called pure context-free (PCF) languages, which is gen- erated by context-free grammars with only one type of symbol (i.e., terminals and nonterminals are not distinguished), and consider the problem of identifying paralleled even monogenic pure context-free (pem-PCF) languages, PCF languages with restricted and enhanced features, from positive data only. In this paper we show that the ploblem o identifying the class of pem-PCF languages is reduced to the ploblem of identifying the class of monogenic PCF (mono-PCF), whose identifiability was shown in [11], by decomposing each string of pem-PCF lan- guages.