Inference of a class of CFPG by means of semantic rules

DOI10.1007/BF00993198MaRDI QIDQ3933778zbMATH OpenFDO

Authors

Publication date 1982

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

Full work available at URL https://doi.org/10.1007/BF00993198

zbMATH Keywords

binary treecontext-free programmed grammarcontext-sensitive languagescontrol diagramgrammatical inferencestochastic grammarsyntactic pattern recognitiontree grammar

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Pattern recognition, speech recognition (68T10)

Cites work

• scientific article; zbMATH DE number 3825216 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Optimization of LR(k) parsers
• Programmed Grammars and Classes of Formal Languages
• Semantics of context-free languages

Cited in

(2)

• Modeling rule-based systems by stochastic programmed production systems
• Inferability of context-free programmed grammars

This page was built for publication: Inference of a class of CFPG by means of semantic rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933778)