On the Solvability of Word Problem by Adian Graphs

Basit Öğe Kaydı
dc.contributor.authorKarpuz, Eylem Güzel
dc.contributor.authorÇevik, Sinan Ahmet
dc.date.accessioned2020-03-26T18:32:54Z
dc.date.available2020-03-26T18:32:54Z
dc.date.issued2012
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe 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.en_US
dc.identifier.citationKarpuz, 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.
dc.identifier.endpage323en_US
dc.identifier.issn1229-3067en_US
dc.identifier.issue2en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage317en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/28797
dc.identifier.volume22en_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorÇevik, Sinan Ahmet
dc.language.isoenen_US
dc.relation.ispartofAdvanced Studies in Contemporary Mathematics (Kyungshang)en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectAdian graphsen_US
dc.subjectRewriting systemen_US
dc.subjectSemigroup presentationen_US
dc.subjectWord problemen_US
dc.titleOn the Solvability of Word Problem by Adian Graphsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
28797.pdf
Boyut:
150.93 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası
İndir

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu
Matematik/Makale Koleksiyonu