Karpuz, Eylem GüzelÇevik, Sinan Ahmet2020-03-262020-03-262012Karpuz, E. G., Çevik, S. A., (2012). On the Solvability of Word Problem by Adian Graphs. Advanced Studies in Contemporary Mathematics (Kyungshang), 22(2), 317-323.1229-3067https://hdl.handle.net/20.500.12395/28797The purpose of this paper is to determine some forms of the relations in a finite semigroup presentation with zero deficiency which have solvable word problem via Adian graphs.eninfo:eu-repo/semantics/openAccessAdian graphsRewriting systemSemigroup presentationWord problemArticle222317323N/A