Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.03331OpenAlexW2494705596MaRDI QIDQ5492898

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

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

Related Items (1)

Inverse monoids: decidability and complexity of algebraic questions.

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