Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492898zbMATH OpenOpenAlexFDO

Authors Markus Lohrey, Nicole Ondrusch

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems, etc. in computability and recursion theory (03D40) Free semigroups, generators and relations, word problems (20M05) Inverse semigroups (20M18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Inverse monoids: decidability and complexity of algebraic questions.
• Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
• Partially commutative inverse monoids.
• scientific article; zbMATH DE number 459339
• The word problem of inverse monoids presented by one idempotent relator

Cited in

(14)

• The second-order monadic theory of the free inverse monoid is undecidable
• Algorithmic properties of inverse monoids with hyperbolic and tree-like Schützenberger graphs
• Inverse monoids: decidability and complexity of algebraic questions.
• ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
• Inverse Monoids, Trees, and Context-Free Languages
• scientific article; zbMATH DE number 178973 (Why is no real title available?)
• scientific article; zbMATH DE number 459339 (Why is no real title available?)
• scientific article; zbMATH DE number 223548 (Why is no real title available?)
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Developments in Language Theory
• Partially Commutative Inverse Monoids
• Trees associated to inverse monoid presentations
• Decision problems for inverse monoids presented by a single sparse relator.
• Partially commutative inverse monoids.

This page was built for publication: Mathematical Foundations of Computer Science 2005

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