Inductive inference of monogenic pure context-free languages

Noriyuki Tanida, Takashi Yokomori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

This paper concerns 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), and investigates the problem of identifying from positive data a restricted class of monogenic pure context-free languages (mono-PCF languages, in short). The class of mono-PCF languages is incomparable to the class of regular languages. 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) satisfying the property that the time for updating a conjecture is bounded by O(N3), 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.

Original languageEnglish
Title of host publicationAlgorithmic Learning Theory - 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994, Proceedings
EditorsSetsuo Arikawa, Klaus P. Jantke
PublisherSpringer Verlag
Pages560-573
Number of pages14
ISBN (Print)9783540585206
Publication statusPublished - 1994 Jan 1
Event4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994 - Reinhardsbrunn Castle, Germany
Duration: 1994 Oct 101994 Oct 15

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume872 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994
CountryGermany
CityReinhardsbrunn Castle
Period94/10/1094/10/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Inductive inference of monogenic pure context-free languages'. Together they form a unique fingerprint.

  • Cite this

    Tanida, N., & Yokomori, T. (1994). Inductive inference of monogenic pure context-free languages. In S. Arikawa, & K. P. Jantke (Eds.), Algorithmic Learning Theory - 4th International Workshop on Analogical and Inductive Inference, AII 1994 and 5th International Workshop on Algorithmic Learning Theory, ALT 1994, Proceedings (pp. 560-573). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 872 LNAI). Springer Verlag.