In this paper, we consider the forgetful functor from the category LDcpo of local dcpos (respectively, Dcpo of dcpos) to the category Pos of posets (respectively, LDcpo of local dcpos), and study the existence of its left and right adjoints. Moreover, we give the concrete forms of free and cofree S-ldcpos over a local dcpo, where S is a local dcpo monoid. The main results are: (1) The forgetful...

We prove that there exist a dimension group G whose positive cone is not isomorphic to the dimension monoid DimL of any lattice L. The dimension group G has an order-unit, and can be taken of any cardinality greater than or equal to א2. As to determining the positive cones of dimension groups in the range of the Dim functor, the א2 bound is optimal. This solves negatively the problem, raised by...

We study the classes of languages defined by valence automata with rational target sets (or equivalently, regular valence grammars with rational target sets), where the valence monoid is drawn from the important class of polycyclic monoids. We show that for polycyclic monoids of rank 2 or more, such automata accept exactly the context-free languages. For the polycyclic monoid of rank 1 (that is...

Assume that G is a group of fractions of a cancellative monoid where lower common multiples exist and divisibility has no infinite descending chain. Then G is torsion free. The result applies in particular to all finite Coxeter type Artin groups. Finding an elementary proof for the fact that Artin’s braid groups are torsion free has been reported to be a longstanding open question [9]. The exis...

Introduction A special monoid is a monoid presented by generators and defining relations of the form w = e, where w is a non-empty word on generators and e is the empty word. Groups are special monoids. But there exist special monoids that are not groups. Special monoids have been extensively studied by Adjanfl] and Makanin[7] (see also [2]). The present paper is a sequel to [11]. In [11], we s...

Functional MSO transductions, deterministic two-way transducers, as well as streaming string transducers are all equivalent models for regular functions. In this paper, we show that every regular function, either on finite words or on infinite words, captured by a deterministic two-way transducer, can be described with a regular transducer expression (RTE). For infinite words, the transducer us...

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such as the index-group, monoid of automata rules, and its subgroup of reversible elements). However for some groups there exist not regular automata isomorphism...

In 1987 Squier defined the notion of finite derivation type for a finitely presented monoid. To do this, he associated a 2-complex to the presentation. The monoid then has finite derivation type if, modulo the action of the free monoid ring, the 1-dimensional homotopy of this complex is finitely generated. Cremanns and Otto showed that finite derivation type implies the homological finiteness c...