{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:29Z","timestamp":1759637789313,"version":"3.33.0"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,12]]},"abstract":"<jats:p>It was recently found that concatenation of formal languages has a logical dual (A. Okhotin, The dual of concatenation, Theoret. Comput. Sci., 345 (2005), 425\u2013447). In this paper, the closure or nonclosure of common language families under dual concatenation with finite, co-finite and regular languages is determined. In addition, language equations with union, linear concatenation and dual concatenation with co-finite constants are shown to be almost equal in power to linear conjunctive grammars.<\/jats:p>","DOI":"10.1142\/s0129054107005406","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T07:37:41Z","timestamp":1193643461000},"page":"1361-1370","source":"Crossref","is-referenced-by-count":2,"title":["NOTES ON DUAL CONCATENATION"],"prefix":"10.1142","volume":"18","author":[{"given":"ALEXANDER","family":"OKHOTIN","sequence":"first","affiliation":[{"name":"Academy of Finland and Department of Mathematics, University of Turku, Turku FIN\u201320014, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00044-0"},{"key":"rf2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FUN-2000-44402","volume":"44","author":"Dassow J.","journal-title":"Fundamenta Informaticae"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00096-2"},{"key":"rf5","first-page":"107","volume":"86","author":"Domaratzki M.","journal-title":"Bull. EATCS"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.013"},{"volume-title":"Introduction to Formal Language Theory","year":"1978","author":"Harrison M.","key":"rf7"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90230-5"},{"key":"rf10","first-page":"187","volume":"7","author":"Liu L. Y.","journal-title":"Mathematical Systems Theory"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_4"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00163-1"},{"key":"rf13","first-page":"519","volume":"6","author":"Okhotin A.","journal-title":"J. of Aut., Lang. and Comb."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2004004"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2004.03.006"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.07.019"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90030-2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107005406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:12:01Z","timestamp":1737504721000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":15,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0129054107005406"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005406","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}