Abstract
The paper presents a new result on the relationship between term rewriting systems (TRSs) and regular tree languages. Important consequences (concerning, in particular, a problem of ground-reducibility) are discussed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Comon H., An effective method for handling initial algebras.—Lect. Notes Comput. Sci., vol.343, 1989, p.108–118.
Comon H., Private communication, October 1989, Nanoy.
Comon H., Inductive proofs by specifications transformation.—Lect. Notes Comput. Sci., 1989, vol.355, p.76–91.
Dauchet M., De Comite, A grap between linear and non linear term-rewriting systems.—Lect. Notes Comput. Sci., 1987, vol.256, p.95–104.
Dershowitz N., Termination of linear term rewirting systems.—Lect. Notes Comput. Sci., 1981, vol.115, p.448–458.
Fribourg L., A strong restriotion of the inductive completion procedure, Lect. Notes Comput. Sci., 1986, vol. 226, p.105–115.
Fulop Z., Vagyvolgyi S., A characterization of irreduoible sets modulo left-linear term-rewriting systems by tree automata.—Lect. Notes Comput. Sci., vol.343, 1989, p.157.
Gallier J.H., Book R.V., Reductions in tree replacement systems.—Theoretical Computer Science, 1985, vol.37, p.123–150.
Guttag J.V., Kapur D., Masser D.R., On proving uniform termination and restricted termination of term rewriting systems.—SIAM Journ. Comput., 1983, vol.12, n.1, p.189–214.
Geoseg F., Steinby M., Tree automata.—Akademiai Kiado, Budapest, 1984.
Huet G., Confluent reductions: abstract properties and applications to term rewriting systems.— Journ. ACM, 1980,vol.27, n.4, p.797–821.
Huet G., Oppen D.C., Equations and rewrite rules: a survey.—Formal Languages Theory: Perspectives and Open Problems, Academic Press, New York, 1980, p.349–405.
Jouannaud J.-P., Kounalis E., Automatic proofs by induction in equational theories without constructors.— Proc. Symp. Logic in Comput. Sci., Cambridge, Mass., June 16–18, 1986, p.358–366.
Kapur D., Narendran P., Zhang H., On sufficient-completeness and related properties of term rewriting systems.— Acta Informatica, 1987, 24, p.395–415.
Kapur D., Narendran P.,Rosenkrantz D.J., Zhang H., Sufficient-Completeness, Quasi-Reducibility and Their Complexity. —TR 87–26, Comp. Sci. Dep., State Univ. of New York at Albany, 1987.
Kounalis E., Zhang H., A general completeness test for equational specifications.— Proc. 4th Hungarian Comput. Sci. Conf., 1985, p.185–200.
Kounalis E., Testing for inductive (co)-reducibility.— Lect. Notes Comput. Sci., vol.431, 1990, p.221–238.
Kucherov G.A. A new quasi-reducibility testing algorithm and its application to proofs by induction.—Lect. Notes Comput. Sci., vol.343, 1989, p.204–213.
Kucherov G.A. On relationship between term rewriting systems and regular tree languages.— INRIA, Rapport de Recherche, No.1273, August 1990.
Lassez J.-L., Marriott K., Explicit representation of terms defined by counter examples, Journ. Automated Reasoning, 1987, 3, p.301–318.
Plaisted D.A., Semantic confluence tests and completion methods.— Inf. and Contr., 1985, 65, p.182–215.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kucherov, G.A. (1991). On relationship between term rewriting systems and regular tree languages. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_105
Download citation
DOI: https://doi.org/10.1007/3-540-53904-2_105
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53904-9
Online ISBN: 978-3-540-46383-2
eBook Packages: Springer Book Archive