Recent advances of grammatical inference
type: Item
instance of: scholarly article
title: Recent advances of grammatical inference
zbMATH Open document ID: 0901.68163
DOI: 10.1016/S0304-3975(97)00014-5
author: Y. Sakakibara
published in: Theoretical Computer Science
publication date: 1998-07-22T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 1177649
zbMATH Keywords: grammatical inference
MaRDI profile type: Publication
cites work: On the computational complexity of approximating distributions by probabilistic automata
cites work: Q4068115
cites work: Finding patterns common to a set of strings
cites work: Inductive inference of formal languages from positive data
cites work: A note on the number of queries needed to identify regular languages
cites work: Inference of Reversible Languages
cites work: Learning regular sets from queries and counterexamples
cites work: Queries and concept learning
cites work: When won't membership queries help?
cites work: Q4013548
cites work: Q4470536
cites work: Q5668012
cites work: Synthesis of real time acceptors
cites work: Q4470541
cites work: Language identification in the limit
cites work: Complexity of automaton identification from given data
cites work: Case-based representation and learning of pattern languages
cites work: Q3484380
cites work: Skeletal structural descriptions
cites work: On the structural grammatical inference problem for some classes of context-free grammars
cites work: Q3126929
cites work: Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
cites work: The minimum consistent DFA problem cannot be approximated within any polynomial
cites work: Learning fallible deterministic finite automata
cites work: Learning context-free grammars from structural data in polynomial time
cites work: On learning from queries and counterexamples in the presence of noise
cites work: Efficient learning of context-free grammars from positive structural examples
cites work: Q4470576
cites work: Rich classes inferable from positive data: Length-bounded elementary formal systems
cites work: Grammatical inference for even linear languages based on control sets
cites work: A hierarchy of language families learnable by regular language learning
cites work: Q3214824
cites work: A theory of the learnable
cites work: Q4731046
cites work: On polynomial-time learnability in the limit of strictly deterministic automata
full work available at URL: s0304-3975(97)00014-5
OpenAlex ID: W2164765168
description: scientific article; zbMATH DE number 1177649