Skip to main content
Conference Proceedings

On relationship between term rewriting systems and regular tree languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1991) 488 LNCS 299-311
DOI: 10.1007/3-540-53904-2_105
11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Kucherov, G. A. (1991). On relationship between term rewriting systems and regular tree languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 488 LNCS, pp. 299–311). Springer Verlag. https://doi.org/10.1007/3-540-53904-2_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free