On regular trace languages

From MaRDI portal





Let A be a finite alphabet and let r be a symmetrical relation on A. Let us consider the free partially commutative monoid M(A,r) generated by A with respect to r (i.e., the quotient of A * by the congruence relation generated by (ab,ba) for all (a,b) in r). It is proved that the free partially commutative monoids M(A,r) whose regular sets form a Boolean algebra or are all unambiguous are the free products of free commutative monoids.




Cited in
(31)


Describes a project that uses

Uses Software






This page was built for publication: On regular trace languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097040)