Trees associated to inverse monoid presentations
Schützenberger graphs play in inverse monoid theory a role similar to the one played by Cayley graphs in group theory. The problem of characterizing those graphs which appear as Schützenberger graphs of inverse monoids can be traced back to a paper by \textit{S. W. Margolis} and \textit{J. C. Meakin} [Semigroup Forum 44, No. 2, 137-148 (1992; Zbl 0757.20017)], where they introduced a necessary and sufficient condition for a tree to be a Schützenberger graph for some idempotent-pure inverse monoid presentation and they proposed the problem of determining necessary and sufficient conditions for a (rational) tree to be a Schützenberger graph for some finite idempotent-pure inverse monoid presentation.NEWLINENEWLINENEWLINEThe main aim of the author in this paper is to establish a necessary and sufficient condition for a tree to be a Schützenberger graph for some finite inverse monoid presentation, and to show that this condition is decidable for an arbitrary rational tree. The author also proves that the condition introduced by Margolis and Meakin for arbitrary inverse monoid presentations (existence of a finite test tree) is decidable for rational trees.
- Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
- Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
- A class of inverse monoids acting on ordered forests.
- Presentations of inverse monoids
- scientific article; zbMATH DE number 4008677
- Mathematical Foundations of Computer Science 2005
- Inverse automata and inverse monoid: Schützenberger-graphs of a semilattice with identity.
- Finite presentability and isomorphism of Cayley graphs of monoids
- Finite idempotent inverse monoid presentations.
- scientific article; zbMATH DE number 459339
- Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups
- CONJUGACY AND TRANSPOSITION FOR INVERSE MONOID PRESENTATIONS
- Free Inverse Semigroups
- scientific article; zbMATH DE number 3869616 (Why is no real title available?)
- scientific article; zbMATH DE number 194088 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
- Inverse monoids and rational Schreier subsets of the free group
- Inverse Monoids, Trees, and Context-Free Languages
- Presentations of inverse monoids
- RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
- The word problem of inverse monoids presented by one idempotent relator
- Inverse monoids and rational Schreier subsets of the free group
- Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
- Finite idempotent inverse monoid presentations.
- Inverse automata and inverse monoid: Schützenberger-graphs of a semilattice with identity.
- Characterizations of Schützenberger graphs in terms of their automorphism groups and fundamental groups
- scientific article; zbMATH DE number 1047874 (Why is no real title available?)
- McAlister'sP-Theorem via Schützenberger Graphs
- Inverse automata and monoids and the undecidability of the cayley subgraph problem for groups
This page was built for publication: Trees associated to inverse monoid presentations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956884)
