{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:16:53Z","timestamp":1649121413537},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p> In this paper we study subword inequalities, that is, inequalities between the number of occurrences of certain scattered subwords in a word. The problem of deciding whether a subword inequality holds for all words was proposed in [5]. We provide partial results describing a few cases in which the subword inequalities hold. Whether a subword inequality falls in these categories is decidable. However, the general question remains open. <\/jats:p>","DOI":"10.1142\/s012905410800611x","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T10:30:40Z","timestamp":1218018640000},"page":"1039-1047","source":"Crossref","is-referenced-by-count":3,"title":["ON INEQUALITIES BETWEEN SUBWORD HISTORIES"],"prefix":"10.1142","volume":"19","author":[{"given":"SZIL\u00c1RD ZSOLT","family":"FAZEKAS","sequence":"first","affiliation":[{"name":"Research Group in Mathematical Linguistics, Universidad Rovira i Virgili, Spain"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"65","volume":"73","author":"Ding C.","journal-title":"Fundamenta Informaticae"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"rf3","volume-title":"Combinatorics on Words","author":"Lothaire M.","year":"1983"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002418"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.04.001"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.024"},{"key":"rf7","first-page":"165","volume":"81","author":"Salomaa A.","journal-title":"EATCS Bulletin"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00396-7"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410800611X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:24:12Z","timestamp":1565191452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410800611X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1142\/S012905410800611X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410800611x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}