Journal of the ACM (JACM)
Linear and Context-Free Graph Grammars
Journal of the ACM (JACM)
Transformations and translations from the point of view of generalized finite automata theory
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Context-free grammars on trees
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Finding Events in a Sea of Bubbles
IEEE Transactions on Computers
The Special Features of POLLY: How They Are Used for Automatic Scanning
IEEE Transactions on Computers
On the relation of graph grammars and graph automata
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Grammars with macro-like productions
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Information Sciences: an International Journal
Web grammars and several graphs
Journal of Computer and System Sciences
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Distributed recursive learning for shape recognition through multiscale trees
Image and Vision Computing
IEEE Transactions on Computers
Representation of Random Waveforms by Relational Trees
IEEE Transactions on Computers
Error-Correcting Tree Automata for Syntactic Pattern Recognition
IEEE Transactions on Computers
A Tree System Approach for Fingerprint Pattern Recognition
IEEE Transactions on Computers
Grammatical inference algorithms for the generation of visual languages
Journal of Visual Languages and Computing
Towards natural question guided search
Proceedings of the 19th international conference on World wide web
Object recognition by recursive learning of multiscale trees
WILF'03 Proceedings of the 5th international conference on Fuzzy Logic and Applications
Inexact graph matching for structural pattern recognition
Pattern Recognition Letters
| Hi-index | 14.99 |
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.