Polynomial-time identification of very simple grammars from positive data.
type: Item
instance of: scholarly article
title: Polynomial-time identification of very simple grammars from positive data.
zbMATH Open document ID: 1038.68074
DOI: 10.1016/S0304-3975(02)00423-1
author: Takashi Yokomori
published in: Theoretical Computer Science
publication date: 2003-05-22T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1915306
zbMATH Keywords: Very simple grammars
zbMATH Keywords: Identification in the limit from positive data
zbMATH Keywords: Polynomial-time learning
MaRDI profile type: Publication
cites work: Inductive inference of formal languages from positive data
cites work: Inference of Reversible Languages
cites work: Learning regular sets from queries and counterexamples
cites work: Q5181346
cites work: Language identification in the limit
cites work: Q4198075
cites work: Q5592246
cites work: Q4072875
cites work: The grammatical inference problem for the Szilard languages of linear grammars
cites work: Remarks on the structural grammatical inference problem for context-free grammars
cites work: Associate languages and derivational complexity of formal grammars and languages
cites work: Towards a mathematical theory of machine discovery from facts
cites work: Q3126924
cites work: Rich classes inferable from positive data: Length-bounded elementary formal systems
cites work: Q4013550
cites work: On polynomial-time learnability in the limit of strictly deterministic automata
full work available at URL: s0304-3975(02)00423-1
OpenAlex ID: W1965255070
Recommended article: Polynomial-Time Identification of an Extension of Very Simple Grammars from Positive Data
Recommended article: Q4440392
Recommended article: Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries
Recommended article: Q3126921
Recommended article: Learning Efficiency of Very Simple Grammars from Positive Data
Recommended article: Learning efficiency of very simple grammars from positive data
Recommended article: Q4440386
Recommended article: Q4370226
Recommended article: Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
Recommended article: Inductive Logic Programming
description: scientific article; zbMATH DE number 1915306