Recognizable languages in divisibility monoids
From MaRDI portal
Publication:4534182
DOI10.1017/S0960129501003395zbMath0994.68083OpenAlexW2019672336MaRDI QIDQ4534182
Manfred Droste, Dietrich Kuske
Publication date: 5 June 2002
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0960129501003395
Related Items (9)
Complete positive group presentations. ⋮ The Generalized Rank of Trace Languages ⋮ Weighted automata with discounting ⋮ Finite transducers for divisibility monoids ⋮ Finitely generated algebras defined by homogeneous quadratic monomial relations and their underlying monoids. ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Rational Transformations and a Kleene Theorem for Power Series over Rational Monoids ⋮ The representation theorem of persistence revisited and generalized ⋮ QUASI-ISOMETRY AND FINITE PRESENTATIONS OF LEFT CANCELLATIVE MONOIDS
This page was built for publication: Recognizable languages in divisibility monoids
