Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
DOI10.1016/j.jalgebra.2022.07.029OpenAlexW2989914729WikidataQ115571719 ScholiaQ115571719MaRDI QIDQ2079248
Nóra Szakács, Pedro V. Silva, Robert D. Gray
Publication date: 29 September 2022
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.00950
word problemhyperbolic groupcontext-free languagevirtually free groupfinitely presented inverse monoidtree-like inverse monoid
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Presentations of inverse monoids
- Groups, the theory of ends, and context-free languages
- On the rational subset problem for groups.
- Decidability of the word problem in Yamamura's HNN extensions of finite inverse semigroups.
- Inverse monoids and rational subsets of related groups
- The word problem of inverse monoids presented by one idempotent relator
- Combinatorial group theory.
- Amalgams of finite inverse semigroups and deterministic context-free languages.
- Amalgams of finite inverse semigroups.
- Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups
- Inverse monoids: decidability and complexity of algebraic questions.
- On Cayley graphs of virtually free groups
- INFINITE WORDS AND CONFLUENT REWRITING SYSTEMS: ENDOMORPHISM EXTENSIONS
- Subgroups of small Cancellation Groups
- Inverse Monoids, Trees, and Context-Free Languages
- FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
- Free Inverse Semigroups
- Geometric Group Theory
- Quasi-hyperbolic planes in hyperbolic groups
- Word hyperbolic semigroups
- Groups acting on semimetric spaces and quasi-isometries of monoids
- Inverse monoids and immersions of 2-Complexes
- Geometric characterizations of virtually free groups
- Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups
- Decision problems for inverse monoids presented by a single sparse relator.
This page was built for publication: Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
