On Confluent Semi-commutations: Decidability and Complexity Results

The subject of this paper is the confluence of finite semi-commutation systems. Confluence of such systems is proved to be decidable property. Existence of a finite complete presentation of a trace monoid using rules only from another given trace monoid is proved to be reducible to the existence of...

Full description

Saved in:
Bibliographic Details
Published inInformation and computation Vol. 110; no. 1; pp. 164 - 182
Main Authors Diekert, V., Ochmanski, E., Reinhardt, K.
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 1994
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Graph
Decidability
Computer theory
Confluence
Decision criterion
Synchronization
Switching
Complexity
Online AccessGet full text
ISSN0890-5401
1090-2651
DOI10.1006/inco.1994.1029

Cover

More Information
Summary:The subject of this paper is the confluence of finite semi-commutation systems. Confluence of such systems is proved to be decidable property. Existence of a finite complete presentation of a trace monoid using rules only from another given trace monoid is proved to be reducible to the existence of a confluent semi-commutation system. Complexity results related to the preceding problems are proved: deciding the existence of finite complete presentations is Σ P 2-complete, whereas deciding confluence of semi-commutation systems is Co-NP-complete. Additionally, an open problem about trace synchronizations is solved: The local checking property is Co-NP-complete.
ISSN:0890-5401
1090-2651
DOI:10.1006/inco.1994.1029