Formal languages and their relation to automata
Formal languages and their relation to automata
Experiments with "Characteristic Loci" for Recognition of Handprinted Characters
IEEE Transactions on Computers
IEEE Transactions on Computers
Real time recognition of hand-drawn characters
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
Real-time recognition of handprinted text
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
Linguistic methods in picture processing: a survey
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Experiments in the recognition of hand-printed text, part I: character recognition
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Experiments in the recognition of hand-printed text, part II: context analysis
AFIPS '68 (Fall, part II) Proceedings of the December 9-11, 1968, fall joint computer conference, part II
Handprinting Input device for computer systems
IEEE Spectrum
| Hi-index | 0.00 |
Theory and algorithm for optimization of a directed and labeled tree are presented. Their application for optimizing any finite pattern grammar represented in the form of a tree is discussed. Tree optimization leads to loss information which is essential for identification of patterns. Special technique for preserving this information has been suggested. Finally, outlines of two different algorithms for the parsing of patterns are included. The tree parser uses the optimized tree and the table-driven parser uses the optimized syntax stored in four separate tables.