Finite transducers for divisibility monoids

Details Finite transducers for divisibility monoids Finite transducers for divisibility monoids

2006-01-13

arxiv.org/abs/math/0601328v1

Mathematics

General Mathematics

20 pages

Scientific paper

Divisibility monoids are a natural lattice-theoretical generalization of Mazurkiewicz trace monoids, namely monoids in which the distributivity of the involved divisibility lattices is kept as an hypothesis, but the relations between the generators are not supposed to necessarily be commutations. Here, we show that every divisibility monoid admits an explicit finite transducer which allows to compute normal forms in quadratic time. In addition, we prove that every divisibility monoid is biautomatic.

Affiliated with

Also associated with

No associations

Rating

Finite transducers for divisibility monoids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite transducers for divisibility monoids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite transducers for divisibility monoids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-452416