scientific article; zbMATH DE number 3946109

MaRDI QIDQ3717032zbMATH OpenFDO

Authors Michail R. Tetruashvili

Publication date 1985

zbMATH Keywords

decision proceduresspace complexityTuring machine

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Free semigroups, generators and relations, word problems (20M05)

Recommendations

• Decidability of elementary theories of lattices of subsemigroups
• scientific article; zbMATH DE number 1748026
• scientific article; zbMATH DE number 4089806
• Semigroups with one defining relation whose elementary theories are solvable
• On ``simple algorithmically undecidable fragments of elementary theory of an infinitely generated free semigroup

Cited in

(2)

• scientific article; zbMATH DE number 4097336 (Why is no real title available?)
• Semigroups with one defining relation whose elementary theories are solvable

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 Q3717032)