On relationship between term rewriting systems and regular tree languages

G. A. Kucherov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationRewriting Techniques and Applications - 4th International Conference, RTA-1991, Proceedings
EditorsRonald V. Book
PublisherSpringer Verlag
Pages299-311
Number of pages13
ISBN (Print)9783540539049
DOIs
Publication statusPublished - 1991
Externally publishedYes
Event4th International Conference on Rewriting Techniques and Applications, RTA-1991 - Como, Italy
Duration: 10 Apr 199112 Apr 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume488 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Rewriting Techniques and Applications, RTA-1991
Country/TerritoryItaly
CityComo
Period10/04/9112/04/91

Fingerprint

Dive into the research topics of 'On relationship between term rewriting systems and regular tree languages'. Together they form a unique fingerprint.

Cite this