scientific article; zbMATH DE number 1936760
From MaRDI portal
Publication:4406627
zbMATH Open1019.03031MaRDI QIDQ4406627
Publication date: 25 June 2003
Full work available at URL: https://eudml.org/doc/50266
Title of this publication is not available (Why is that?)
Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Turing machines and related notions (03D10)
Related Items (3)
Lower bounds on words separation: are there short identities in transformation semigroups? ⋮ Title not available (Why is that?) ⋮ Real computational universality: the word problem for a class of groups with infinite presentation
Recommendations
- Title not available (Why is that?) 👍 👎
- Space functions and space complexity of the word problem in semigroups. 👍 👎
- Complexity of the word problem for commutative semigroups of fixed dimension 👍 👎
- A note on decidability questions on presentations of word semigroups 👍 👎
- On the complexity of the word problem for automaton semigroups and automaton groups 👍 👎
- On the word problem for finitely-generated semigroups 👍 👎
- Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups 👍 👎
- Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem 👍 👎
- ON GENERIC COMPLEXITY OF THE ISOMORPHISM PROBLEM FOR FINITE SEMIGROUPS 👍 👎
- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups 👍 👎
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4406627)
