Inferability of context-free programmed grammars

DOI10.1007/BF00989482zbMath0554.68048MaRDI QIDQ3217619

No author found.

Publication date: 1984

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

zbMATH Keywords

grammatical inferencesyntactic pattern recognitionstring languageRecursive structuressyntactic pattern analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10)

Related Items (1)

Modeling rule-based systems by stochastic programmed production systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of LR(k) parsers
• A general approach to inference of context-free programmed grammars
• Inference of a class of CFPG by means of semantic rules
• Syntactic/semantic techniques in pattern recognition: A survey
• A solution of the syntactical induction-inference problem for regular languages
• Programmed Grammars and Classes of Formal Languages

This page was built for publication: Inferability of context-free programmed grammars