본문 바로가기
KERD
논문KCI 등재

On the solvability of word problem by Adian graphs

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

주제분류수학

초록

The purpose of this paper is to determine some forms of the relations in a nite semigroup presentation with zero de ciency which have solvable word problem via Adian graphs.

Abstract

The purpose of this paper is to determine some forms of the relations in a nite semigroup presentation with zero de ciency which have solvable word problem via Adian graphs.

참고문헌 (12)

  1. S. I. Adian, "Word transformations in a semigroup that is given by a system of defining relations", Algebra, Logika, 15, pp.611~621 (1976)
  2. S. I. Adian, "Decision Problems for Groups and Semigroups", Russian Math. Surveys, 55(2), pp.207~296 (2000)
  3. G. Ayik, "On semigroup presentations and Adian graphs", Discrete Math- ematics, 308, pp.2288~2291 (2008)
  4. H. Ayik, "On semigroup presentations and eciency", Semigroup Forum, 63, pp.231~242 (2002)
  5. R. V. Book, "String-Rewriting Systems" (1993), Springer-Verlag
  6. P. M. Higgins, "Techniques of Semigroup Theory" (1992), Oxford University Press
  7. J. M. Howie, "Fundamentals of Semigroup Theory" (1995), Clarendon Press
  8. D. E. Knuth, "Simple Word Problems in Universal Algebras, Computational Problems in Abstract Algebra", pp.263~297 (1970), Pergamon Press
  9. G. U. Oganesyan, "A class of semigroups with a decidable word problem, M. V. Lomonosov Moscow University", Translated from Mathematicheskie Zametki, 24(2), pp.259~265 (1978)
  10. O. A. Sarkisjan, "On the word and divisibility problems in semigroups and groups without cycles", Math. USSR Izvestija, 19(3), pp.643~656 (1982)
  11. C. C. Sims, "Computation for Finitely Presented Groups" (1994), Cambridge University Press
  12. R. J. Wilson, "Graphs: An Introductory Approach" (1990), Wiley

관련 논문AI추천

이 간행물의 다른 논문 (10건)