Affordable Access

Publisher Website

An extension of the wreath product principle for finite Mazurkiewicz traces

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier
Publication Date
Volume
67
Issue
6
Identifiers
DOI: 10.1016/s0020-0190(98)00123-9
Keywords
  • Concurrency
  • Formal Languages
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract The wreath product principle on words, due to Straubing, has been used, along with the Krohn-Rhodes theorem, to give elegant syntactic proofs of several important theorems in different fields of computer science. We extend in this paper the wreath product principle to finite Mazurkiewicz traces.

There are no comments yet on this publication. Be the first to share your thoughts.