{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T07:44:34Z","timestamp":1778744674704,"version":"3.51.4"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Algebra Comput."],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p> This paper proves that any monoid presented by a confluent context-free monadic rewriting system is word-hyperbolic. This result then applied to answer a question asked by Duncan and Gilman by exhibiting an example of a word-hyperbolic monoid that does not admit a word-hyperbolic structure with uniqueness (that is, in which the language of representatives maps bijectively onto the monoid). <\/jats:p>","DOI":"10.1142\/s0218196712500610","type":"journal-article","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T00:37:01Z","timestamp":1344818221000},"page":"1250061","source":"Crossref","is-referenced-by-count":9,"title":["CONTEXT-FREE REWRITING SYSTEMS AND WORD-HYPERBOLIC STRUCTURES WITH UNIQUENESS"],"prefix":"10.1142","volume":"22","author":[{"given":"ALAN J.","family":"CAIN","sequence":"first","affiliation":[{"name":"Centro de Matem\u00e1tica, Universidade do Porto, Rua do Campo Alegre 687, 4169\u2013007 Porto, Portugal"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VICTOR","family":"MALTCEV","sequence":"additional","affiliation":[{"name":"School of Mathematics &amp; Statistics, University of St Andrews, North Haugh, St Andrews, Fife KY16 9SS, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,12,3]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"rf2","author":"Cain A. J.","journal-title":"Beitr\u00e4ge. Algebra Geom."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00151-6"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196709005111"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004103007497"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1201\/9781439865699"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/9789812702616_0007"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s002090100356"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-9586-7_3"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1142\/9789812776884_0016"},{"key":"rf11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979"}],"container-title":["International Journal of Algebra and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218196712500610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:31:57Z","timestamp":1565181117000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218196712500610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":11,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2012,12,3]]},"published-print":{"date-parts":[[2012,11]]}},"alternative-id":["10.1142\/S0218196712500610"],"URL":"https:\/\/doi.org\/10.1142\/s0218196712500610","relation":{},"ISSN":["0218-1967","1793-6500"],"issn-type":[{"value":"0218-1967","type":"print"},{"value":"1793-6500","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11]]}}}