2010, ISBN: 6130354436

[EAN: 9786130354435], Neubuch, [PU: VDM Verlag Dr. Müller E.K.], nach der Bestellung gedruckt Neuware -High Quality Content by WIKIPEDIA articles! In mathematics and computer science, a t… Altro …

[EAN: 9786130354435], Neubuch, [PU: VDM Verlag Dr. Müller E.K.], nach der Bestellung gedruckt Neuware -High Quality Content by WIKIPEDIA articles! 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. Englisch, Books<

2010, ISBN: 6130354436

[EAN: 9786130354435], Neubuch, [PU: Betascript Publishers Feb 2010], Neuware - High Quality Content by WIKIPEDIA articles! In mathematics and computer science, a trace is a set of strings… Altro …

[EAN: 9786130354435], Neubuch, [PU: Betascript Publishers Feb 2010], Neuware - High Quality Content by WIKIPEDIA articles! 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. 108 pp. Englisch<

2010, ISBN: 9786130354435

Erscheinungsdatum: 06.02.2010, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Trace Monoid, Titelzusatz: Mathematics, Computer Science, String (Computer Science), Parallel … Altro …

Erscheinungsdatum: 06.02.2010, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Trace Monoid, Titelzusatz: Mathematics, Computer Science, String (Computer Science), Parallel Computing, Monoid, Dependency Graph, Trace Theory, Semigroup, Homomorphism, Formal Language, Redaktion: Surhone, Lambert M. // Timpledon, Miriam T. // Marseken, Susan F., Verlag: VDM Verlag Dr. Müller e.K., Sprache: Englisch, Schlagworte: Informatik, Rubrik: Informatik, Seiten: 108, Informationen: Paperback, Gewicht: 179 gr, Verkäufer: averdo Belletristik<

2010, ISBN: 6130354436

Kartoniert / Broschiert, mit Schutzumschlag neu, [PU:Betascript Publishers]

ISBN: 9786130354435

Livre