The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids

نویسندگان

  • Dietrich Kuske
  • Olena Prianychnykova
چکیده

We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix representations of trace monoids

We consider trace monoids i.e., free monoids where some pairs of letters are allowed to commute. We show that such monoids can be faithfully represented by 22-matrices with integer entries if and only if it they are direct products of a free commutative monoid with a free product of free commutative monoids.

متن کامل

2 9 Ju n 20 06 Resolutions of free partially commutative monoids

In this paper we construct a free resolution for a free partially commutative monoid and with its help prove the Husainov’s Conjecture. We follow the ideas of D. Cohen who built in [3] a resolution for the so-called graph product of groups, given resolutions for factors. The presentation of the graph product with the help of direct and free amalgamated products played the leading role at that. ...

متن کامل

Some Undecidability Results Related to the Star Problem in Trace Monoids

This paper deals with decision problems related to the star problem in trace monoids, which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme from 1994 30, 31], we know that the Star Problem is decidable in trace monoids which do not contain a C4-submonoid. The C4 is (isomorphic to) the Cartesian Product of two free monoids o...

متن کامل

Divisibility Monoids: Presentation, Word Problem, and Rational Languages

We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We give a decidable class of presentations that gives rise precisely to all divisibility monoids. (2) We show that any divisibility monoid is an automatic monoid [5]. This implies that its word problem is solvable in quadratic tim...

متن کامل

Bg = Pg: a Success Story

All semigroups and monoids except free monoids and free groups are assumed finite in this paper. A monoid M divides a monoid N if M is a quotient of a submonoid of N . The set of idempotents of a monoid M is denoted E(M). The word “variety” will be used for pseudo-variety — that is, a collection of finite monoids closed under division and finite direct product. A block group is a monoid such th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016