Skip to main content
Log in

Decidable First-Order Theories of One-Step Rewriting in Trace Monoids

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We prove that the first-order theory of the one-step rewriting relation associated with a trace rewriting system is decidable but in general not elementary. This extends known results on semi-Thue systems but our proofs use new methods; these new methods yield the decidability of local properties expressed in first-order logic augmented by modulo-counting quantifiers. Using the main decidability result, we define several subclasses of trace rewriting systems for which the confluence problem is decidable.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to Dietrich Kuske or Markus Lohrey.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kuske, D., Lohrey, M. Decidable First-Order Theories of One-Step Rewriting in Trace Monoids. Theory Comput Systems 38, 39–81 (2005). https://doi.org/10.1007/s00224-004-1099-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-004-1099-9

Keywords

Navigation