Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the complexity of individual identity problems in semigroups

From MaRDI portal
Publication:2556854
Jump to:navigation, search

DOI10.1007/BF02218980zbMath0251.02046MaRDI QIDQ2556854

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) Word problems, etc. in computability and recursion theory (03D40) Other degrees and reducibilities in computability and recursion theory (03D30)


Related Items (1)

Unsolvable algorithmic problems for semigroups, groups and rings




Cites Work

  • Machine Configuration and Word Problems of Given Degree of Unsolvability
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2556854&oldid=15300515"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 05:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki