Trace monoid
id:
trace-monoid-254-7994293
title:
Trace monoid
text:
In computer science, a trace is a set of strings, wherein certain letters in the string are allowed to commute, but others are not. It generalizes the concept of a string, by not forcing the letters to always be in a fixed order, but allowing certain reshufflings to take place. Traces were introduced by Pierre Cartier and Dominique Foata in 1969 to give a combinatorial proof of MacMahon's master theorem. Traces are used in theories of concurrent computation, where commuting letters stand for por
brand slug:
wiki
category slug:
encyclopedia
description:
Generalization of strings in computer science
original url:
https://en.wikipedia.org/wiki/Trace_monoid
date created:
date modified:
2022-10-26T16:18:56Z
main entity:
{"identifier":"Q3321292","url":"https://www.wikidata.org/entity/Q3321292"}
image:
fields total:
13
integrity:
14