Learning context-free grammars from structural data in polynomial time
type: Item
instance of: scholarly article
title: Learning context-free grammars from structural data in polynomial time
zbMATH Open document ID: 0704.68067
DOI: 10.1016/0304-3975(90)90017-C
author: Y. Sakakibara
published in: Theoretical Computer Science
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4155905
zbMATH Keywords: context-free grammars
zbMATH Keywords: grammatical inference problem
zbMATH Keywords: context-free languages
zbMATH Keywords: Structural descriptions
zbMATH Keywords: unlabelled derivation trees
zbMATH Keywords: equivalence queries
zbMATH Keywords: membership queries
MaRDI profile type: Publication
cites work: Learning regular sets from queries and counterexamples
cites work: The minimalization of tree automata
cites work: Q5668012
cites work: The use of grammatical inference for designing programming languages
cites work: Q3309084
cites work: Complexity of automaton identification from given data
cites work: Skeletal structural descriptions
Recommended article: Learning Cover Context-Free Grammars from Structural Data
Recommended article: Efficient learning of context-free grammars from positive structural examples
Recommended article: Q2754019
Recommended article: Learning Context Free Grammars with the Syntactic Concept Lattice
Recommended article: Q4440396
Recommended article: Learning context-free grammars using tabular representations
Recommended article: Q4599201
Recommended article: Grammatical Inference: Algorithms and Applications
Recommended article: Learning deterministic regular grammars from stochastic samples in polynomial time
description: scientific article; zbMATH DE number 4155905