The word problem for inverse monoids presented by one idempotent relator
Theoretical Computer Science
The expression of graph properties and graph transformations in monadic second-order logic
Handbook of graph grammars and computing by graph transformation
Commutativity in free inverse monoids
Theoretical Computer Science - Special issue: papers dedicated to the memory of Marcel-Paul Schützenberger
Word Problems Solvable in Logspace
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Confluent and Other Types of Thue Systems
Journal of the ACM (JACM)
Pushdown processes: games and model-checking
Information and Computation - Special issue on FLOC '96
Modal and temporal properties of processes
Modal and temporal properties of processes
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Extensions and submonoids of automatic monoids
Theoretical Computer Science
Conjugacy in Free Inverse Monoids
IWWERT '91 Proceedings of the Second International Workshop on Word Equations and Related Topics
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
A Note on the Hardness of Tree Isomorphism
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
The kleene equality for graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Partially commutative inverse monoids
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Inverse monoids: decidability and complexity of algebraic questions
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Compressedword problems for inverse monoids
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Logspace computations in graph groups and coxeter groups
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Hi-index | 0.00 |
This paper investigates the word problem for inverse monoids generated by a set @C subject to relations of the form e=f, where e and f are both idempotents in the free inverse monoid generated by @C. It is shown that for every fixed monoid of this form the word problem can be solved both in linear time on a RAM as well as in deterministic logarithmic space, 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.