Sequential classification of strings generated by SCFG's

DOI10.1007/BF01007759zbMATH Open0301.68026OpenAlexW2037269794MaRDI QIDQ4055155FDOQ4055155

Authors:

Publication date: 1975

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cites Work

• An efficient context-free parsing algorithm
• Title not available (Why is that?)
• Applying Probability Measures to Abstract Languages
• Syntactic methods in pattern recognition
• A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification
• Title not available (Why is that?)
• A syntactic approach to fingerprint pattern recognition
• Stochastic grammars and languages

Cited In (1)

• Approximation of multipath planar shapes in pattern analysis

This page was built for publication: Sequential classification of strings generated by SCFG's

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