A Study on Parallel Parsing of Tree Languages and Its Application to Syntactic Pattern Recognition

  • N. S. Chang
  • K. S. Fu


The tree systems approach to pattern recognition has received increasing attention by Fu and Bhargava (1973) and Fu (1974). It has been shown to be an effective method for the classification of bubble chamber events, fingerprint pattern recognition, and the LANDSAT data interpretation as discussed in Fu (1977). Instead of using a string representation of primitives and relations, tree systems use a tree structure to represent a pattern in terms of its primitives and relations. Multidimensional patterns can be described more efficiently and effectively by a tree language than by a string representation. As long as patterns can be described by a tree structures, the associated tree grammars can be easily constructed or inferred. Tree automata can then be used to classify unknown patterns according to the constructed pattern grammars.


LANDSAT Image Tree Representation Tree Automaton Tree Language Grammar Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bear, J. L., “A Survey of Some Theoretical Aspects of Multiprocessing,” Computing Surveys 5(1): 31–80 (1973).CrossRefGoogle Scholar
  2. Chang, N. S., Mulrooney, T., and Weiderman, N., “An Interactive Simulator for Microprogramming Development,” Proc. 11th An. Simulation Symposium (March 15–17, 1978), pp. 271–282.Google Scholar
  3. Data General Corporation, Microprogramming the ECLIPSE Computer with the WCS Feature, Southboro (Aug. 1975).Google Scholar
  4. Fishman, G. S., Concepts and Methods in Discrete Event Digital Simulation, New York, Wiley (1973).Google Scholar
  5. Fu, K. S., Syntactic Methods in Pattern Recognition, New York, Academic Press (1974).Google Scholar
  6. Fu, K. S., “Tree Languages and Syntactic Pattern Recognition,” in Pattern Recognition and Artificial Intelligence (Chen, C. H., ed.), New York, Academic Press (1977), pp. 257–291.Google Scholar
  7. Fu K. S., and Bhargava, B. K., “Tree Systems for Syntactic Pattern Recognition,” IEEE Trans. Comput. C-22;1087–1099 (1973).CrossRefGoogle Scholar
  8. Keng, J., and Fu, K. S., “A Syntax-Directed Method for Land-Use Classification of LANDSAT Images,” Proc. Symp. Current Math. Prob. Image Science, Monterey (Nov. 10–12, 1976).Google Scholar
  9. Kuck, D. J., “A Survey of Parallel Machine Organization Programming,” Computing Surveys 9(1):29–59 (1977).CrossRefGoogle Scholar
  10. Li, R. Y., and Fu, K. S., “Tree System Approach for LANDSAT Data Interpretation,” Proc. Symp. Machine Proc. Remot. Sensed Data, Purdue University (1976).Google Scholar
  11. Lu, S. Y., and Fu, K. S., “Structure-Preserved Error-Correcting Tree Automata for Syntactic Pattern Recognition,” Proc. IEEE Conf. Decision and Control (Dec. 1–3, 1976).Google Scholar
  12. Lu, S. Y., and Fu, K. S., “A Syntactic Approach to Texture Analysis,” Comput. Graph. Image Proc. 7:303–330 (1978).CrossRefGoogle Scholar
  13. Ritchie, E., and Thompson, K., “The UNIX Time-Sharing System,” Comm. ACM 17(7):365–375 (1974).CrossRefGoogle Scholar
  14. Rosenfeld, J. L., “A Case Study in Programming for Parallel-Processes,” Comm. ACM 12(12):645–658 (1969).CrossRefGoogle Scholar
  15. Sastry, K. V., and Kain, R. Y., “On the Performance of Certain Multiprocessor Computer Organizations,” IEEE Trans. Comput. C-24(11):1066–1074 (1975).CrossRefGoogle Scholar
  16. Thurber, K. J., and Wald, L. D., “Associative and Parallel Processors,” Computing Surveys 7(4):215–255 (1975).CrossRefGoogle Scholar

Copyright information

© Plenum Press, New York 1981

Authors and Affiliations

  • N. S. Chang
    • 1
  • K. S. Fu
    • 1
  1. 1.School of Electrical EngineeringPurdue UniversityWest LafayetteUSA

Personalised recommendations