Partially commutative inverse monoids.

DOI10.1007/S00233-008-9060-XMaRDI QIDQ958191zbMATH OpenOpenAlexFDO

Authors Volker Diekert, Markus Lohrey, Alexander Miller

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

zbMATH Keywords

algorithmsword problemfinite presentationsmembership probleminverse monoidsfree partially commutative monoidsrational setsidempotent presentations

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Partially Commutative Inverse Monoids
• Mathematical Foundations of Computer Science 2005
• Inverse monoids: decidability and complexity of algebraic questions.
• Publication:3469280
• Word problem languages for free inverse monoids

Cites work

• scientific article; zbMATH DE number 1670767 (Why is no real title available?)
• scientific article; zbMATH DE number 1722707 (Why is no real title available?)
• scientific article; zbMATH DE number 988810 (Why is no real title available?)
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 3869616 (Why is no real title available?)
• scientific article; zbMATH DE number 1335884 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1088188 (Why is no real title available?)
• scientific article; zbMATH DE number 3257446 (Why is no real title available?)
• ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
• Almost finite expansions of arbitrary semigroups
• An Algorithm for the General Petri Net Reachability Problem
• Combinatorics on traces
• Complexity results for 1-safe nets
• Confluent and Other Types of Thue Systems
• Decidability of Second-Order Theories and Automata on Infinite Trees
• E-unitary inverse monoids and the Cayley graph of a group presentation
• Free Inverse Semigroups
• Graph groups, coherence, and three-manifolds
• Inverse Monoids, Trees, and Context-Free Languages
• Inverse monoids: decidability and complexity of algebraic questions.
• On the rational subset problem for groups.
• Partially Commutative Inverse Monoids
• Presentations of inverse monoids
• Pushdown processes: Games and model-checking
• Rudiments of \(\mu\)-calculus
• SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
• Subgroups of graph groups
• The Word Problem in the Variety of Inverse Semigroups with Abélian Covers
• The theory of ends, pushdown automata, and second-order logic
• The word problem for free partially commutative groups
• Word Problems Solvable in Logspace

Cited in

(10)

• The word problem for free partially commutative groups
• Inverse monoids: decidability and complexity of algebraic questions.
• Inverting Elements in Rigid Monoids
• The word problem for free partially commutative, partially associative groupoids
• On the complexity of inverse semigroup conjugacy
• Groups with identities
• On graph products of monoids
• Compressed word problems for inverse monoids
• Mathematical Foundations of Computer Science 2005
• Partially Commutative Inverse Monoids

This page was built for publication: Partially commutative inverse monoids.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q958191)