Finite transducers for divisibility monoids
Matthieu Picantin
Abstract
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.
Create a lesson
Related papers
A Note on the Measure of Vector and Pythagorean Theorem
Yu. V. Brezhnev
On Weighted Convex Graphs
Angshuman R. Goswami
On characterizations, Decompositions, and Stability of Convex Sequences
Angshuman R. Goswami
New Laplace convolution integrals involving exponential, error, and parabolic cylinder functions with applications in heat transfer and linear viscoelasticity
González Santander, Juan Luis
Resolution of Singularities in Positive Characteristic: Frobenius-Hasse Towers and Exceptional-History Descent
Chenxiao Tian
Information Geometry (IG) Lives at Edge or Boundary of SMG (statistically meaningful geometry): - the First Edge Theorem and Applications
Bing Cheng, Yi-Shuai Niu, Howell Tong et al.