Inductive Inference of Context-free Languages Based on Context-free Expressions

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

An inductive inference problem of context-free languages is considered. There have been many attempts to this problem, and most of them are based on a problem setup in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper, on the contrary, employs a kind of extensions of regular expressions called context-free expressions as a representation space for context-free languages. The algorithm, based on the notion of an identification in the limit, is significantly concise when compared with existing algorithms. Then, a subclass of context-free languages is examined, and a simpler algorithm for the subclass is presented. Further, a topic on meta inductive inference is briefly discussed.

Original languageEnglish
Pages (from-to)115-140
Number of pages26
JournalInternational Journal of Computer Mathematics
Volume24
Issue number2
DOIs
Publication statusPublished - 1988 Jan 1
Externally publishedYes

Fingerprint

Context free languages
Inductive Inference
Context-free Languages
Context free grammars
Context-free Grammar
Regular Expressions
Context

Keywords

  • context-free expression
  • context-free language
  • Inductive inference algorithm
  • meta inference

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Applied Mathematics

Cite this

Inductive Inference of Context-free Languages Based on Context-free Expressions. / Yokomori, Takashi.

In: International Journal of Computer Mathematics, Vol. 24, No. 2, 01.01.1988, p. 115-140.

Research output: Contribution to journalArticle

@article{d2c9368654e543f89d1627cd044ac681,
title = "Inductive Inference of Context-free Languages Based on Context-free Expressions",
abstract = "An inductive inference problem of context-free languages is considered. There have been many attempts to this problem, and most of them are based on a problem setup in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper, on the contrary, employs a kind of extensions of regular expressions called context-free expressions as a representation space for context-free languages. The algorithm, based on the notion of an identification in the limit, is significantly concise when compared with existing algorithms. Then, a subclass of context-free languages is examined, and a simpler algorithm for the subclass is presented. Further, a topic on meta inductive inference is briefly discussed.",
keywords = "context-free expression, context-free language, Inductive inference algorithm, meta inference",
author = "Takashi Yokomori",
year = "1988",
month = "1",
day = "1",
doi = "10.1080/00207168808803637",
language = "English",
volume = "24",
pages = "115--140",
journal = "International Journal of Computer Mathematics",
issn = "0020-7160",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - Inductive Inference of Context-free Languages Based on Context-free Expressions

AU - Yokomori, Takashi

PY - 1988/1/1

Y1 - 1988/1/1

N2 - An inductive inference problem of context-free languages is considered. There have been many attempts to this problem, and most of them are based on a problem setup in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper, on the contrary, employs a kind of extensions of regular expressions called context-free expressions as a representation space for context-free languages. The algorithm, based on the notion of an identification in the limit, is significantly concise when compared with existing algorithms. Then, a subclass of context-free languages is examined, and a simpler algorithm for the subclass is presented. Further, a topic on meta inductive inference is briefly discussed.

AB - An inductive inference problem of context-free languages is considered. There have been many attempts to this problem, and most of them are based on a problem setup in which a representation space for hypotheses is a class of context-free grammars. An inference algorithm given in this paper, on the contrary, employs a kind of extensions of regular expressions called context-free expressions as a representation space for context-free languages. The algorithm, based on the notion of an identification in the limit, is significantly concise when compared with existing algorithms. Then, a subclass of context-free languages is examined, and a simpler algorithm for the subclass is presented. Further, a topic on meta inductive inference is briefly discussed.

KW - context-free expression

KW - context-free language

KW - Inductive inference algorithm

KW - meta inference

UR - http://www.scopus.com/inward/record.url?scp=36749100682&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=36749100682&partnerID=8YFLogxK

U2 - 10.1080/00207168808803637

DO - 10.1080/00207168808803637

M3 - Article

AN - SCOPUS:36749100682

VL - 24

SP - 115

EP - 140

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 2

ER -