Inductive Inference of Monogenic Pure Context-Free Languages<SUP>**</SUP>

Noriyuki TANIDA; Takashi YOKOMORI

Inductive Inference of Monogenic Pure Context-Free Languages^**

Noriyuki TANIDA, Takashi YOKOMORI

Full Text Views

0

Cite this

Summary :

A subclass of context-free languages, called pure context-free languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), is introduced and the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short) is investigated. The class of mono-PCF languages is incomparable to the class of regular languages. In this paper we show that the class of mono-PCF languages is polynomial time identifiable from positive data. That is, there is an algorithm that, given a mono-PCF language L, identifies from positive data, a grammar generating L, called a monogenic pure context-free grammar (mono-PCF grammar, in short) satisfying the property that the time for updating a conjecture is bounded by O(N³), where N is the sum of lengths of all positive data provided. This is in contrast with another result in this paper that the class of PCF languages is not identifiable in the limit from positive data.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.11 pp.1503-1510

Publication Date: 1996/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Algorithm and Computational Complexity

Cite this

Copy

Noriyuki TANIDA, Takashi YOKOMORI, "Inductive Inference of Monogenic Pure Context-Free Languages**" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 11, pp. 1503-1510, November 1996, doi: .
Abstract: A subclass of context-free languages, called pure context-free languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), is introduced and the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short) is investigated. The class of mono-PCF languages is incomparable to the class of regular languages. In this paper we show that the class of mono-PCF languages is polynomial time identifiable from positive data. That is, there is an algorithm that, given a mono-PCF language L, identifies from positive data, a grammar generating L, called a monogenic pure context-free grammar (mono-PCF grammar, in short) satisfying the property that the time for updating a conjecture is bounded by O(N³), where N is the sum of lengths of all positive data provided. This is in contrast with another result in this paper that the class of PCF languages is not identifiable in the limit from positive data.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_11_1503/_p

Copy

@ARTICLE{e79-d_11_1503,
author={Noriyuki TANIDA, Takashi YOKOMORI, },
journal={IEICE TRANSACTIONS on Information},
title={Inductive Inference of Monogenic Pure Context-Free Languages**},
year={1996},
volume={E79-D},
number={11},
pages={1503-1510},
abstract={A subclass of context-free languages, called pure context-free languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), is introduced and the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short) is investigated. The class of mono-PCF languages is incomparable to the class of regular languages. In this paper we show that the class of mono-PCF languages is polynomial time identifiable from positive data. That is, there is an algorithm that, given a mono-PCF language L, identifies from positive data, a grammar generating L, called a monogenic pure context-free grammar (mono-PCF grammar, in short) satisfying the property that the time for updating a conjecture is bounded by O(N³), where N is the sum of lengths of all positive data provided. This is in contrast with another result in this paper that the class of PCF languages is not identifiable in the limit from positive data.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Inductive Inference of Monogenic Pure Context-Free Languages**
T2 - IEICE TRANSACTIONS on Information
SP - 1503
EP - 1510
AU - Noriyuki TANIDA
AU - Takashi YOKOMORI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 1996
AB - A subclass of context-free languages, called pure context-free languages, which is generated by context-free grammar with only one type of symbol (i.e., terminals and nonterminals are not distinguished), is introduced and the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short) is investigated. The class of mono-PCF languages is incomparable to the class of regular languages. In this paper we show that the class of mono-PCF languages is polynomial time identifiable from positive data. That is, there is an algorithm that, given a mono-PCF language L, identifies from positive data, a grammar generating L, called a monogenic pure context-free grammar (mono-PCF grammar, in short) satisfying the property that the time for updating a conjecture is bounded by O(N³), where N is the sum of lengths of all positive data provided. This is in contrast with another result in this paper that the class of PCF languages is not identifiable in the limit from positive data.
ER -