{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:53:50Z","timestamp":1649163230865},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,6]]},"abstract":"<jats:p> We present two new results on 2-collapsing words. First, we show that the language of all 2-collapsing words over 2 letters is not context-free. Second, we prove that the length of a 2-collapsing word over an arbitrary finite alphabet \u03a3 is at least 2|\u03a3|<jats:sup>2<\/jats:sup> thus improving the previously known lower bound |\u03a3|<jats:sup>2<\/jats:sup> + 1. <\/jats:p>","DOI":"10.1142\/s0129054106004030","type":"journal-article","created":{"date-parts":[[2006,6,6]],"date-time":"2006-06-06T11:11:37Z","timestamp":1149592297000},"page":"665-676","source":"Crossref","is-referenced-by-count":1,"title":["ON SOME PROPERTIES OF THE LANGUAGE OF 2-COLLAPSING WORDS"],"prefix":"10.1142","volume":"17","author":[{"given":"ELENA V.","family":"PRIBAVKINA","sequence":"first","affiliation":[{"name":"Department of Mathematics and Mechanics, Ural State University, 620083 Ekaterinburg, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219498803000519"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45005-X_23"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00093-8"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46011-X_13"},{"key":"rf6","volume-title":"Transductions and Context-free Languages","author":"Berstel J.","year":"1969"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61896-3"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.2307\/1969513"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002406"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01694004"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01236507"},{"key":"rf12","first-page":"171","volume":"31","author":"Sauer N.","journal-title":"Ars Combinatoria"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106004030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:28:25Z","timestamp":1565191705000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106004030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":11,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1142\/S0129054106004030"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106004030","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}