License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07441.3
URN: urn:nbn:de:0030-drops-14109
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1410/
Go to the corresponding Portal

Lohrey, Markus

Application of verification techniques to inverse monoids

pdf-format:
07441.LohreyMarkus.ExtAbstract.1410.pdf (0.1 MB)

Abstract

The word problem for inverse monoids generated by
a set $Gamma$ subject to relations of the form $e=f$, where $e$ and $f$
are both idempotents in the free inverse monoid generated by $Gamma$,
is investigated. It is
shown that for every fixed monoid of this form the word problem
can be solved in polynomial time which solves an open problem of
Margolis and Meakin. For the uniform word problem, where the presentation is
part of the input, EXPTIME-completeness is shown.
For the Cayley-graphs of these
monoids, it is shown that the first-order theory with regular path
predicates is decidable. Regular path predicates allow to state
that there is a path from a node $x$ to a node $y$ that is labeled
with a word from some regular language. As a corollary, the decidability
of the generalized word problem is deduced. Finally, some results
on free partially commutative inverse monoids are presented.


BibTeX - Entry

@InProceedings{lohrey:DagSemProc.07441.3,
  author =	{Lohrey, Markus},
  title =	{{Application of verification techniques to inverse monoids}},
  booktitle =	{Algorithmic-Logical Theory of Infinite Structures},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{7441},
  editor =	{Rod Downey and Bakhadyr Khoussainov and Dietrich Kuske and Markus Lohrey and Moshe Y. Vardi},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1410},
  URN =		{urn:nbn:de:0030-drops-14109},
  doi =		{10.4230/DagSemProc.07441.3},
  annote =	{Keywords: Inverse monoids, word problems, Cayley-graphs, complexity}
}

Keywords: Inverse monoids, word problems, Cayley-graphs, complexity
Collection: 07441 - Algorithmic-Logical Theory of Infinite Structures
Issue Date: 2008
Date of publication: 09.04.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI