Copyright © 1975 Published by Elsevier Science B.V.
A multidimensional approach to syntactic pattern recognition
Received 6 June 1974;
Abstract
This paper describes a syntactic method for representing the primitive parts of a pattern as nodes of a type of directed graph. A linear representation of the digraph can then be presented to a regular unordered tree automaton for classification. Regular unordered tree automata can be simulated by deterministic pushdown automata, so this procedure can be implemented easily. Regular u-tree automata and the corresponding generative systems, regular u-tree grammars are formally defined. Several results are shown which are applicable to all syntactic pattern recognition schemes involving the use of primitives.
Author Keywords: Syntactic pattern recognition; Regular unordered tree grammars; Regular unordered tree automata; Primitive; Primitive feature system; Pushdown automata






E-mail Article
Add to my Quick Links

Cited By in Scopus (0)





