Trace rewriting: Computing normal forms in time O(n log n)

DOI10.1007/3-540-60922-9_23zbMath1379.68193OpenAlexW1519152213MaRDI QIDQ4593937

Michael Bertol, Volker Diekert

Publication date: 16 November 2017

Published in: STACS 96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60922-9_23

zbMATH Keywords

Mazurkiewicz tracesrewriting modulo a partial commutation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Grammars and rewriting systems (68Q42)

Related Items (1)

Confluence problems for trace rewriting systems

This page was built for publication: Trace rewriting: Computing normal forms in time O(n log n)