Finite transducers for divisibility monoids

Simple item page
dc.creatorPicantin, Matthieu
dc.date2006-01-13
dc.date.accessioned2026-07-07T06:58:53Z
dc.date.available2026-07-07T06:58:53Z
dc.descriptionDivisibility 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.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/math/0601328
dc.identifierhttp://arxiv.org/abs/math/0601328
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/107539
dc.subjectGeneral Mathematics
dc.titleFinite transducers for divisibility monoids
dc.typetext

Files

Collections

arXiv