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