2,608 research outputs found
The algebra of rewriting for presentations of inverse monoids
We describe a formalism, using groupoids, for the study of rewriting for
presentations of inverse monoids, that is based on the Squier complex
construction for monoid presentations. We introduce the class of pseudoregular
groupoids, an example of which now arises as the fundamental groupoid of our
version of the Squier complex. A further key ingredient is the factorisation of
the presentation map from a free inverse monoid as the composition of an
idempotent pure map and an idempotent separating map. The relation module of a
presentation is then defined as the abelianised kernel of this idempotent
separating map. We then use the properties of idempotent separating maps to
derive a free presentation of the relation module. The construction of its
kernel - the module of identities - uses further facts about pseudoregular
groupoids.Comment: 22 page
Equations over free inverse monoids with idempotent variables
We introduce the notion of idempotent variables for studying equations in
inverse monoids.
It is proved that it is decidable in singly exponential time (DEXPTIME)
whether a system of equations in idempotent variables over a free inverse
monoid has a solution. The result is proved by a direct reduction to solve
language equations with one-sided concatenation and a known complexity result
by Baader and Narendran: Unification of concept terms in description logics,
2001. We also show that the problem becomes DEXPTIME hard , as soon as the
quotient group of the free inverse monoid has rank at least two.
Decidability for systems of typed equations over a free inverse monoid with
one irreducible variable and at least one unbalanced equation is proved with
the same complexity for the upper bound.
Our results improve known complexity bounds by Deis, Meakin, and Senizergues:
Equations in free inverse monoids, 2007.
Our results also apply to larger families of equations where no decidability
has been previously known.Comment: 28 pages. The conference version of this paper appeared in the
proceedings of 10th International Computer Science Symposium in Russia, CSR
2015, Listvyanka, Russia, July 13-17, 2015. Springer LNCS 9139, pp. 173-188
(2015
Domain theory and mirror properties in inverse semigroups
Inverse semigroups are a class of semigroups whose structure induces a
compatible partial order. This partial order is examined so as to establish
mirror properties between an inverse semigroup and the semilattice of its
idempotent elements, such as continuity in the sense of domain theory.Comment: 15 pages. The final publication is available at www.springerlink.com.
See http://link.springer.com/article/10.1007%2Fs00233-012-9392-4?LI=tru
Uniform decision problems in automatic semigroups
We consider various decision problems for automatic semigroups, which involve
the provision of an automatic structure as part of the problem instance. With
mild restrictions on the automatic structure, which seem to be necessary to
make the problem well-defined, the uniform word problem for semigroups
described by automatic structures is decidable. Under the same conditions, we
show that one can also decide whether the semigroup is completely simple or
completely zero-simple; in the case that it is, one can compute a Rees matrix
representation for the semigroup, in the form of a Rees matrix together with an
automatic structure for its maximal subgroup. On the other hand, we show that
it is undecidable in general whether a given element of a given automatic
monoid has a right inverse.Comment: 19 page
- …