{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:35:31Z","timestamp":1774956931026,"version":"3.50.1"},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p> A bounded language [Formula: see text] (for some k \u2265 1 and not-necessarily distinct nonempty words x<jats:sub>1<\/jats:sub>, \u2026, x<jats:sub>k<\/jats:sub>) is bounded semilinear if the set [Formula: see text] is semilinear. We give characterizations of bounded semilinear languages in terms of one-way and two-way deterministic counter machines. <\/jats:p>","DOI":"10.1142\/s0129054112400539","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T03:26:33Z","timestamp":1353900393000},"page":"1291-1305","source":"Crossref","is-referenced-by-count":23,"title":["CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES"],"prefix":"10.1142","volume":"23","author":[{"given":"OSCAR H.","family":"IBARRA","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of California, Santa Barbara, CA 93106, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SHINNOSUKE","family":"SEKI","sequence":"additional","affiliation":[{"name":"Department of Systems Bioscience for Drug Discovery, Kyoto  University, 46-29, Yoshida-Shimo-Adachi-cho, Sakyo-ku, Kyoto, 606-8501, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,11,25]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80027-9"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_6"},{"key":"rf5","first-page":"111","volume":"80","author":"Engelfriet J.","journal-title":"Fundamenta Informaticae"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1965-0174934-9"},{"key":"rf7","first-page":"333","volume":"113","author":"Ginsburg S.","journal-title":"Transactions of the American Mathematical Society"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322152"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90028-3"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(81)80003-5"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322058"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1624"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321364"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054112400539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T12:03:01Z","timestamp":1565092981000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054112400539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":11,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2012,11,25]]},"published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1142\/S0129054112400539"],"URL":"https:\/\/doi.org\/10.1142\/s0129054112400539","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}