On the complexity of individual identity problems in semigroups

DOI10.1007/BF02218980MaRDI QIDQ2556854zbMATH OpenFDO

Authors Z. K. Litvinceva

Publication date 1971

Published in Algebra and Logic (Search for Journal in Brave)

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30) Word problems, etc. in computability and recursion theory (03D40)

Cites work

• scientific article; zbMATH DE number 3317755 (Why is no real title available?)
• Machine Configuration and Word Problems of Given Degree of Unsolvability

Cited in

(1)

• Unsolvable algorithmic problems for semigroups, groups and rings

This page was built for publication: On the complexity of individual identity problems in semigroups

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