Pages that link to "Item:Q2643082"
From MaRDI portal
The following pages link to Inverse monoids: decidability and complexity of algebraic questions. (Q2643082):
Displaying 11 items.
- On groups that have normal forms computable in logspace. (Q375212) (← links)
- Partially commutative inverse monoids. (Q958191) (← links)
- The second-order monadic theory of the free inverse monoid is undecidable (Q1280226) (← links)
- The word problem for nilpotent inverse monoids (Q1902161) (← links)
- Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs (Q2079248) (← links)
- On labeled birooted tree languages: algebras, automata and logic (Q2347808) (← links)
- The word problem for free adequate semigroups (Q2934271) (← links)
- FINITE IDEMPOTENT INVERSE MONOID PRESENTATIONS (Q3112581) (← links)
- ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS (Q3502752) (← links)
- Decision problems for inverse monoids presented by a single sparse relator. (Q5962338) (← links)
- On the complexity of inverse semigroup conjugacy (Q6098988) (← links)