Inverse Monoids , Trees , and Context-Free Languages

@inproceedings{Margolis2008InverseM,
  title={Inverse Monoids , Trees , and Context-Free Languages},
  author={Stuart W. Margolis and John C. Meakin},
  year={2008}
}
This paper is concerned with a study of inverse monoids presented by a set X subject to relations of the form e¡ = f¡, i € I, where e¡ and f¡ are Dyck words, i.e. idempotents of the free inverse monoid on X . Some general results of Stephen are used to reduce the word problem for such a presentation to the membership problem for a certain subtree of the Cayley graph of the free group on X . In the finitely presented case the word problem is solved by using Rabin's theorem on the second order… CONTINUE READING
10 Citations
10 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Presentations of inverse monoids

  • J. B. Stephen
  • J. Pure Appl. Algebra
  • 1990
Highly Influential
8 Excerpts

E-unitary inverse monoids and the Cayley graph of a group presentation

  • S. W. Margolis, J. Meakin
  • J. Pure Appl. Algebra
  • 1989
Highly Influential
5 Excerpts

Scheiblich, Free inverse semigroups

  • H E.
  • Proc. Amer. Math. Soc
  • 1973
Highly Influential
3 Excerpts

Free inverse semigroups

  • W. D. Munn
  • Proc. London Math. Soc
  • 1974
2 Excerpts

Similar Papers

Loading similar papers…