{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:24:15Z","timestamp":1777645455209,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T00:00:00Z","timestamp":1610668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2021,1,15]]},"abstract":"<jats:p>\n                    In this paper, we study a certain case of a subgraph isomorphism problem. We consider the Hasse diagram of the lattice M\n                    <jats:sub>k<\/jats:sub>\n                    (the unique lattice with k + 2 elements and one anti-chain of length k) and find the maximal k for which it is isomorphic to a subgraph of the reduction graph of a given one-rule string rewriting system. We obtain a complete characterization for this problem and show that there is a dichotomy. There are one-rule string rewriting systems for which the maximal such k is 2 and there are cases where there is no maximum. No other intermediate option is possible.\n                  <\/jats:p>","DOI":"10.3233\/fi-2021-2002","type":"journal-article","created":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T12:18:18Z","timestamp":1610713098000},"page":"173-185","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System"],"prefix":"10.1177","volume":"178","author":[{"given":"Arthur","family":"Adinayev","sequence":"first","affiliation":[{"name":"Software Engineering Department, Shamoon College of Engineering, Israel. arthuad@ac.sce.ac.il"}]},{"given":"Itamar","family":"Stein","sequence":"additional","affiliation":[{"name":"Mathematics Unit, Shamoon College of Engineering, Israel. Steinita@gmail.com"}]}],"member":"179","published-online":{"date-parts":[[2021,1,15]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2021-2002","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2021-2002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:15Z","timestamp":1777444335000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2021-2002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,15]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,1,15]]}},"alternative-id":["10.3233\/FI-2021-2002"],"URL":"https:\/\/doi.org\/10.3233\/fi-2021-2002","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,15]]}}}