Inference of a class of CFPG by means of semantic rules

DOI10.1007/BF00993198zbMath0477.68090MaRDI QIDQ3933778

No author found.

Publication date: 1982

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

zbMATH Keywords

binary treegrammatical inferencecontext-sensitive languagesstochastic grammarsyntactic pattern recognitiontree grammarcontrol diagramcontext-free programmed grammar

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Optimization of LR(k) parsers
• Inductive inference of formal languages from positive data
• Semantics of context-free languages
• Programmed Grammars and Classes of Formal Languages

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