Recent advances of grammatical inference

DOI10.1016/S0304-3975(97)00014-5zbMath0901.68163OpenAlexW2164765168MaRDI QIDQ1390941

Yasubumi Sakakibara

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00014-5

zbMATH Keywords

grammatical inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Grammars and rewriting systems (68Q42)

Related Items

LARS: a learning algorithm for rewriting systems, Pattern computation in neural communication systems, Polynomial characteristic sets for \(DFA\) identification, Learning Meaning Before Syntax, Learning indexed families of recursive languages from positive data: A survey, E-generalization using grammars, Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms, Learning context-free grammars using tabular representations, Evolutionary induction of stochastic context free grammars, Logic-based genetic programming with definite clause translation grammars

Cites Work

• Case-based representation and learning of pattern languages
• On learning from queries and counterexamples in the presence of noise
• Learning context-free grammars from structural data in polynomial time
• Learning regular sets from queries and counterexamples
• Grammatical inference for even linear languages based on control sets
• Finding patterns common to a set of strings
• Efficient learning of context-free grammars from positive structural examples
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• On the structural grammatical inference problem for some classes of context-free grammars
• On the computational complexity of approximating distributions by probabilistic automata
• Rich classes inferable from positive data: Length-bounded elementary formal systems
• Synthesis of real time acceptors
• When won't membership queries help?
• Learning fallible deterministic finite automata
• On polynomial-time learnability in the limit of strictly deterministic automata
• Queries and concept learning
• A hierarchy of language families learnable by regular language learning
• A theory of the learnable
• Inductive inference of formal languages from positive data
• Inference of Reversible Languages
• The minimum consistent DFA problem cannot be approximated within any polynomial
• Complexity of automaton identification from given data
• Skeletal structural descriptions
• A note on the number of queries needed to identify regular languages
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item