Inductive inference of context-free languages based on context-free expressions

DOI10.1080/00207168808803637zbMath0658.68095OpenAlexW2093626492MaRDI QIDQ3806846

Takashi Yokomori

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803637

zbMATH Keywords

regular expressionscontext-free languagesinductive inferencecontext-free expressionsmeta inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)

Related Items (1)

Learning tree languages from text

Cites Work

• Unnamed Item
• Derivation-bounded languages
• A characterization of context-free languages
• On characteristic sets and degrees of finite automata
• A theory of the learnable
• A method for inferring context-free grammars
• Grammar enumeration and inference
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Language identification in the limit

This page was built for publication: Inductive inference of context-free languages based on context-free expressions