{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:25:43Z","timestamp":1648801543996},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,2]]},"abstract":"<jats:p> A bisemigroup is a set with two associative operations. Subsets of free bisemigroups are called bisemigroup languages. Recognizable, regular and MSO-definable bisemigroup languages have been studied earlier, and these classes are known to be equal. In this paper we prove a Kleene theorem for bisemigroup languages, namely we show that the class of recognizable bisemigroup languages is the least class which contains the finite languages and closed under the operations of union, horizontal and vertical product, horizontal and vertical iteration, \u03be-substitution and a restricted version of the the \u03be-iteration. We extend our result to binoid languages, i.e., to subsets of free algebras, where the two associative operations share a common identity element. <\/jats:p>","DOI":"10.1142\/s012905411100812x","type":"journal-article","created":{"date-parts":[[2011,2,21]],"date-time":"2011-02-21T05:13:46Z","timestamp":1298265226000},"page":"427-446","source":"Crossref","is-referenced-by-count":0,"title":["A KLEENE THEOREM FOR BISEMIGROUP AND BINOID LANGUAGES"],"prefix":"10.1142","volume":"22","author":[{"given":"ZSOLT","family":"GAZDAG","sequence":"first","affiliation":[{"name":"Faculty of Informatics, E\u00f6tv\u00f6s Lor\u00e1nd University, P.O.B. 120, 1518 Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZOLT\u00c1N L.","family":"N\u00c9METH","sequence":"additional","affiliation":[{"name":"Inst. of Informatics, University of Szeged, P.O.B. 652, 6701 Szeged, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","unstructured":"M.\u00a0Boja\u0144czyk and I.\u00a0Walukiewicz, Logic and Automata: History and Perspectives, eds. J.\u00a0Flum, E.\u00a0Gr\u00e4del and Th.\u00a0Wilke (Amsterdam University Press, 2008)\u00a0pp. 107\u2013132."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2004.07.004"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.11.028"},{"key":"rf5","first-page":"3","volume":"9","author":"\u00c9sik Z.","journal-title":"J. of Autom. Lang. Comb."},{"key":"rf6","first-page":"219","volume":"5","author":"Hashiguchi K.","journal-title":"J. Autom. Lang. Comb."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00137-3"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2003.09.005"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00031-1"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3077"},{"key":"rf12","first-page":"567","volume":"16","author":"N\u00e9meth Z. L.","journal-title":"Acta Cybern."},{"key":"rf13","first-page":"765","volume":"18","author":"N\u00e9meth Z. L.","journal-title":"Acta Cybern."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905411100812X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:34:05Z","timestamp":1565123645000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905411100812X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2]]},"references-count":11,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,2]]}},"alternative-id":["10.1142\/S012905411100812X"],"URL":"https:\/\/doi.org\/10.1142\/s012905411100812x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2]]}}}