Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Trace Monoid: Mathematics, Computer Science, String (Computer Science), Parallel Computing, Monoid, Dependency Graph, Trace Theory, Semigroup, Homomorphism, Formal Language -

inglise keel
2026-03-20
157,17 € 224,53 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 15-21 tööpäeva jooksul

30-päevane tagastamisõigus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics and 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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics and 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 are used in theories of concurrent computation, where commuting letters stand for portions of a job that can execute independently of one-another, while non-commuting letters stand for locks, synchronization points or thread joins. The trace monoid or free partially commutative monoid is a monoid of traces. In a nutshell, it is constructed as follows: sets of commuting letters are given by an independency relation. These induce an equivalence relation of equivalent strings; the elements of the equivalence classes are the traces. The equivalence relation then partitions up the free monoid (the set of all strings of finite length) into a set of equivalence classes; the result is still a monoid; it is a quotient monoid and is called the trace monoid. The trace monoid is universal, in that all homomorphic monoids are in fact isomorphic.

Lisateave

Kirjastaja OmniScriptum
Väljalaskeaasta 2026
Kaanetüüp Pehme kaanega
EAN 9786130354435
Kirjuta oma arvustus
Te vaatate: Trace Monoid: Mathematics, Computer Science, String (Computer Science), Parallel Computing, Monoid, Dependency Graph, Trace Theory, Semigroup, Homomorphism, Formal Language
Teie hinnang:

Goodreads'i arvustused

157,17 € 224,53 €