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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
A. Salomaa,Formal Languages (Academic Press, New York, 1973).
W. S. Brainerd, “Tree Generating Regular Systems,”Infor. and Contr. 14:217–231 (1969).
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).
R. C. Gonzalez and M. G. Thomason,Syntactic Pattern Recognition: An Introduction (Addison-Wesley, Reading, Mass., 1978).
K. S. Fu and B. K. Bhargava, “Tree Systems for Syntactic Pattern Recognition,”IEEE Trans. Comput. 22:1087–1099 (1973).
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).
M. G. Thomason and R. C. Gonzalez, “Syntactic Recognition of Imperfectly Specified Patterns,”IEEE Trans. Comput. C24:93–95 (1975).
Author information
Authors and Affiliations
Additional information
Work supported by the Office of Naval Research, Arlington, VA, under Contract N00014-75-C-0545.
Rights 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
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00996800