Partially commutative inverse monoids.
From MaRDI portal
Publication:958191
DOI10.1007/s00233-008-9060-xzbMath1156.20049OpenAlexW1972682040MaRDI QIDQ958191
Markus Lohrey, Alexander Miller, Volker Diekert
Publication date: 2 December 2008
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-008-9060-x
algorithmsword probleminverse monoidsmembership problemfree partially commutative monoidsfinite presentationsrational setsidempotent presentations
Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Inverse semigroups (20M18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgroups of graph groups
- Presentations of inverse monoids
- Graph groups, coherence, and three-manifolds
- Complexity results for 1-safe nets
- Almost finite expansions of arbitrary semigroups
- On the rational subset problem for groups.
- The theory of ends, pushdown automata, and second-order logic
- The word problem for free partially commutative groups
- E-unitary inverse monoids and the Cayley graph of a group presentation
- Combinatorics on traces
- Pushdown processes: Games and model-checking
- Inverse monoids: decidability and complexity of algebraic questions.
- SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
- ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
- An Algorithm for the General Petri Net Reachability Problem
- Confluent and Other Types of Thue Systems
- Inverse Monoids, Trees, and Context-Free Languages
- Free Inverse Semigroups
- Word Problems Solvable in Logspace
- The Word Problem in the Variety of Inverse Semigroups with Abélian Covers
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Partially Commutative Inverse Monoids
- Rudiments of \(\mu\)-calculus
This page was built for publication: Partially commutative inverse monoids.
