{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:17:40Z","timestamp":1648927060052},"reference-count":5,"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":[[2013,6]]},"abstract":"<jats:p> Extending the general undecidability result concerning the absoluteness of inequalities between subword histories, in this paper we show that the question whether such inequalities hold for all words is undecidable even over a binary alphabet and bounded number of blocks, i.e., unary factors of maximal length. <\/jats:p>","DOI":"10.1142\/s0129054113500135","type":"journal-article","created":{"date-parts":[[2013,8,2]],"date-time":"2013-08-02T08:04:30Z","timestamp":1375430670000},"page":"445-452","source":"Crossref","is-referenced-by-count":0,"title":["A NOTE ON THE DECIDABILITY OF SUBWORD INEQUALITIES"],"prefix":"10.1142","volume":"24","author":[{"given":"SZIL\u00c1RD ZSOLT","family":"FAZEKAS","sequence":"first","affiliation":[{"name":"Mathematics and Informatics Institute, College of Ny\u00edregyh\u00e1za, S\u00f3st\u00f3i \u00fat 31.\/b Ny\u00edregyh\u00e1za 4400, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ROBERT","family":"MERCA\u015e","sequence":"additional","affiliation":[{"name":"Fakult\u00e4t f\u00fcr Informatik, Otto-von-Guericke-Universit\u00e4t Magdeburg, PSF 4120, D-39016 Magdeburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,8,2]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410800611X"},{"key":"p_3","first-page":"10","author":"Manders Kenneth","year":"1980","journal-title":"Springer Berlin\/Heidelberg"},{"issue":"6","key":"p_4","first-page":"551","volume":"35","author":"Mateescu Alexandru","year":"2001","journal-title":"ITA"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.04.001"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.10.017"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:17:01Z","timestamp":1565187421000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500135"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":5,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2013,8,2]]},"published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1142\/S0129054113500135"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500135","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]}}}