{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:43:30Z","timestamp":1777596210932,"version":"3.51.4"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2010,10]]},"abstract":"<jats:p> It is proved that the language family generated by Boolean grammars is effectively closed under injective gsm mappings and inverse gsm mappings (where gsm stands for a generalized sequential machine). The same results hold for conjunctive grammars, unambiguous Boolean grammars and unambiguous conjunctive grammars. <\/jats:p>","DOI":"10.1142\/s0129054110007568","type":"journal-article","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T09:40:06Z","timestamp":1286271606000},"page":"799-815","source":"Crossref","is-referenced-by-count":9,"title":["BOOLEAN GRAMMARS AND GSM MAPPINGS"],"prefix":"10.1142","volume":"21","author":[{"given":"TOMMI","family":"LEHTINEN","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Turku, Turku FI\u201320014, Finland"},{"name":"Turku Centre for Computer Science, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALEXANDER","family":"OKHOTIN","sequence":"additional","affiliation":[{"name":"Academy of Finland, and Department of Mathematics, University of Turku, Turku FI\u201320014, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80011-0"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/321160.321167"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/321341.321345"},{"key":"rf5","volume-title":"Introduction to Formal Language Theory","author":"Harrison M. A.","year":"1978"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321366"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90015-X"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410800584X"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-008-9139-5"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.05.002"},{"key":"rf11","first-page":"519","volume":"6","author":"Okhotin A.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2004004"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.03.006"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106004029"},{"key":"rf15","first-page":"96","volume":"91","author":"Okhotin A.","journal-title":"Bulletin of the EATCS"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-007-0045-0"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.03.023"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054110007568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:24:02Z","timestamp":1565191442000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054110007568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":16,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2010,10]]}},"alternative-id":["10.1142\/S0129054110007568"],"URL":"https:\/\/doi.org\/10.1142\/s0129054110007568","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10]]}}}