On confluent semi-commutations: Decidability and complexity results

DOI10.1006/INCO.1994.1029zbMath0804.68075OpenAlexW2067311660MaRDI QIDQ1322470

Klaus Reinhardt, Edward Ochmański, Volker Diekert

Publication date: 5 May 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1029

zbMATH Keywords

decidabilityconfluencetrace monoidfinite semi-commutation systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of compilers and interpreters (68N20) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On the synchronization of semi-traces

This page was built for publication: On confluent semi-commutations: Decidability and complexity results