Rational term rewriting revisited: Decidability and confluence

Takahito Aoto, Jeroen Ketema

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

We consider a variant of rational term rewriting as first introduced by Corradini et al., i.e., we consider rewriting of (infinite) terms with a finite number of different subterms. Motivated by computability theory, we show a number of decidability results related to the rewrite relation and prove an effective version of a confluence theorem for orthogonal systems.

Original languageEnglish
Title of host publicationGraph Transformations - 6th International Conference, ICGT 2012, Proceedings
Pages172-186
Number of pages15
DOIs
Publication statusPublished - 2012 Oct 24
Event6th International Conference on Graph Transformations, ICGT 2012 - Bremen, Germany
Duration: 2012 Sep 242012 Sep 29

Publication series

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

Other

Other6th International Conference on Graph Transformations, ICGT 2012
CountryGermany
CityBremen
Period12/9/2412/9/29

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Rational term rewriting revisited: Decidability and confluence'. Together they form a unique fingerprint.

Cite this