Tree Systems for Syntactic Pattern Recognition
- 1 December 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (12), 1087-1099
- https://doi.org/10.1109/t-c.1973.223654
Abstract
An approach of representing patterns by trees rather than by strings is described. A review of tree systems that include tree grammars, transformations, and mappings on trees and tree automata is briefly presented. The tree system is then applied to the problem of syntactic pattern recognition. Tree grammars are used for pattern description, and tree automata are used for classification. Illustrative examples include the application of the tree system to the classification of bubble chamber events and some English characters.Keywords
This publication has 21 references indexed in Scilit:
- Web grammars and several graphsJournal of Computer and System Sciences, 1973
- On the relation of graph grammars and graph automataPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Plex languagesInformation Sciences, 1971
- Mappings and grammars on treesTheory of Computing Systems, 1970
- Separable graphs, planar graphs and web grammarsInformation and Control, 1970
- A mathematical model of transformational grammarsInformation and Control, 1969
- Context-free grammars on treesPublished by Association for Computing Machinery (ACM) ,1969
- Transformations and translations from the point of view of generalized finite automata theoryPublished by Association for Computing Machinery (ACM) ,1969
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- Computer Interpretation of English Text and Picture PatternsIEEE Transactions on Electronic Computers, 1964