Skip to main content
SpringerLink
Log in

Regular-like tree expressions

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

Regular-like expressions provide a compact notation for the explicit description of context-free languages. In this paper we extend these concepts by establishing a one-to-one correspondence between expansive tree languages and regular-like sets of trees. Algorithms are developed for constructing an expansive tree grammar whose language is defined by a given regular-like tree (RLT) expression, and vice versa. These results are then used to obtain RLT equations that describe sets of tree resulting from regularity-preserving transformations associated with three types of errors commonly found in practice.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Salomaa,Formal Languages (Academic Press, New York, 1973).

    Google Scholar 

  2. W. S. Brainerd, “Tree Generating Regular Systems,”Infor. and Contr. 14:217–231 (1969).

    Google Scholar 

  3. J. W. Thatcher and J. B. Wright, “Generalized Finite Automata Theory with Application to a Decision Problem of Second Order Logic,”J. Math. System Theory 2:57–82 (1968).

    Google Scholar 

  4. R. C. Gonzalez and M. G. Thomason,Syntactic Pattern Recognition: An Introduction (Addison-Wesley, Reading, Mass., 1978).

    Google Scholar 

  5. K. S. Fu and B. K. Bhargava, “Tree Systems for Syntactic Pattern Recognition,”IEEE Trans. Comput. 22:1087–1099 (1973).

    Google Scholar 

  6. M. A. Arbib and Y. Give'On, “Algebra Automata I: Parallel Programming as a Prolegomena to the Categorical Approach,”Infor. and Contr. 12:331–345 (1968).

    Google Scholar 

  7. M. G. Thomason and R. C. Gonzalez, “Syntactic Recognition of Imperfectly Specified Patterns,”IEEE Trans. Comput. C24:93–95 (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, University of Tennessee, Ferris Hall, 37916, Knoxville, Tennessee

    A. Barrero & R. C. Gonzalez

  2. Department of Computer Science, University of Tennessee, 8 Ayres Hall, 37916, Knoxville, Tennessee

    M. G. Thomason

Authors
  1. A. Barrero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. G. Thomason
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. C. Gonzalez
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Work supported by the Office of Naval Research, Arlington, VA, under Contract N00014-75-C-0545.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barrero, A., Thomason, M.G. & Gonzalez, R.C. Regular-like tree expressions. International Journal of Computer and Information Sciences 12, 1–11 (1983). https://doi.org/10.1007/BF00996800

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00996800

Key words

Search

Navigation