Journal ArticleDOI
Tree Systems for Syntactic Pattern Recognition
King-Sun Fu,Bharat Bhargava +1 more
TLDR
An approach of representing patterns by trees rather than by strings is described, and the tree system is applied to the problem of syntactic pattern recognition.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.read more
Citations
More filters
Journal ArticleDOI
The Tree-to-Tree Correction Problem
TL;DR: An algorithm is presented which solves the problem of determining the distance from T to T' as measured by the mlmmum cost sequence of edit operaUons needed to transform T into T'.
Book
Tree automata
TL;DR: A context-free grammar over the terminal alphabet generating the Dyck language of well-bracketed strings and a product construction for nondeterministic bu-ta A 1 and A 2, to discuss whether there are simpler means of specifying them formally.
Book
Syntactic Methods in Pattern Recognition
King-Sun Fu,Mark A. Aizerman +1 more
TL;DR: This book is an integrated sequence of papers Professor Michie has published, for a general audience, over the last decade or so.
Journal ArticleDOI
Inexact graph matching for structural pattern recognition
Horst Bunke,G Allermann +1 more
TL;DR: This paper is concerned with the inexact matching of attributed, relational graphs for structural pattern recognition and the matching procedure is based on a state space search utilizing heuristic information.
References
More filters
Journal ArticleDOI
Generalized finite automata theory with an application to a decision problem of second-order logic
TL;DR: The standard closure theorems are proved for the class of sets “recognizable” by finite algebras, and a generalization of Kleene's regularity theory is presented.
Journal ArticleDOI
Tree acceptors and some of their applications
TL;DR: It is shown here that the weak secondorder theory of two successors is decidable, thus settling a problem of Buchi, and this result is applied to obtain positive solutions to the decision problems for various other theories, e.g., the weaksecond-order theories of order types built up from the finite types.
Journal ArticleDOI
Mappings and grammars on trees
TL;DR: This paper studies certain sets, functions, and relations on trees using natural generalizations of ordinary automata theory using Thatcher and Wright's algebraic formalism to give succinct descriptions of linguistic constructions in the tree case.
Journal ArticleDOI
Local Properties of Binary Images in Two Dimensions
TL;DR: E Easily computable binary image characterizations are introduced, with reference to a serial binary image processor (BIP) now being built, and some implications for image computation theory are examined.
Journal ArticleDOI
A formal picture description scheme as a basis for picture processing systems
TL;DR: A formal picture description scheme to be used as the basis for picture processing systems is presented and a series of examples illustrate the capability and limitations of the description scheme.