The word problem for 1LC congruences is NP-hard

Authors:
Laurent Rosaz
Affiliations:
Laboratoire de Recherche en Informatique (L.R.I.), Université Paris-Sud, Centre d'Orsay, CNRS U.R.A., 410 Bâtiment 490, 91405 Orsay Cedex, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 10
Cited 0

Petri nets: an introduction

Petri nets: an introduction
Semi-commutations

Information and Computation
Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Theory of traces

Theoretical Computer Science
An asychronous model for distributed systems (French)

Theoretical Computer Science
On the concatenation of infinite traces (extended abstract)

STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
The poset of infinitary traces

Theoretical Computer Science
The Book of Traces

The Book of Traces
A Trace Semantics for Petri Nets (Extended Abstract)

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Word Problem for Thue Rewriting Systems

Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, it is proved that the word problem for congruences generated by subsets of {(abc,acb)|a ∈ A ∪ {ε},b, c ∈ A) is NP-hard. These congruences are a generalization of Mazurkiewicz's traces.