Undecidable properties of flat term rewrite systems

Abstract Reachability, joinability and confluence properties are known to be undecidable for flat term rewrite systems (TRS). We give shorter and conceptually simpler proofs of these results. We also prove undecidability of weak normalization and unique normalization properties for flat TRS.

Gespeichert in:
Autor*in:

Godoy, Guillem [verfasserIn]

Hernández, Hugo

Format:

E-Artikel

Sprache:

Englisch

Erschienen:

2009

Schlagwörter:

Term rewriting

Syntactic restrictions

Undecidability

Anmerkung:

© Springer-Verlag 2009

Übergeordnetes Werk:

Enthalten in: Applicable algebra in engineering, communication and computing - Berlin : Springer, 1990, 20(2009), 2 vom: 21. Apr., Seite 187-205

Übergeordnetes Werk:

volume:20 ; year:2009 ; number:2 ; day:21 ; month:04 ; pages:187-205

Links:

Volltext

DOI / URN:

10.1007/s00200-009-0097-1

Katalog-ID:

SPR00175663X

Nicht das Richtige dabei?

Schreiben Sie uns!