{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:44:51Z","timestamp":1648712691351},"reference-count":13,"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":[[2008,4]]},"abstract":"<jats:p> A weighted finite-state machine with n tapes describes a rational relation on n strings. We recall some basic operations on n-ary rational relations, recast the important join operation in terms of \"auto-intersection\", and propose restricted algorithms for both operations. If two rational relations are joined on more than one tape, it can unfortunately lead to non-rational relations with undecidable properties. As a consequence, there cannot be a fully general algorithm, able to compile any rational join or auto-intersection. We define a class of triples \u3008A,i,j\u3009 for which we are able to compile the auto-intersection of the machine A w.r.t. tapes i and j. We hope that this class is sufficient for many practical applications. <\/jats:p>","DOI":"10.1142\/s0129054108005760","type":"journal-article","created":{"date-parts":[[2008,4,10]],"date-time":"2008-04-10T07:30:22Z","timestamp":1207812622000},"page":"453-476","source":"Crossref","is-referenced-by-count":1,"title":["ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES"],"prefix":"10.1142","volume":"19","author":[{"given":"JEAN-MARC","family":"CHAMPARNAUD","sequence":"first","affiliation":[{"name":"LITIS, Universit\u00e9 de Rouen, 76800 Saint-Etienne du Rouvray, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCK","family":"GUINGNE","sequence":"additional","affiliation":[{"name":"Xerox Research Centre Europe \u2013 Grenoble Laboratory, 6 chemin de Maupertuis \u2013 38240 Meylan, France"},{"name":"I3S (Universit\u00e9 de Nice\u2013Sophia Antipolis, CNRS), 06903 Sophia Antipolis Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ANDR\u00c9","family":"KEMPE","sequence":"additional","affiliation":[{"name":"Xerox Research Centre Europe \u2013 Grenoble Laboratory, 6 chemin de Maupertuis \u2013 38240 Meylan, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FLORENT","family":"NICART","sequence":"additional","affiliation":[{"name":"Xerox Research Centre Europe \u2013 Grenoble Laboratory, 6 chemin de Maupertuis \u2013 38240 Meylan, France"},{"name":"Department of Engineering Mathematics, University of Bristol, Queen's Building, University Walk, Clifton, Bristol, BS8 1TR, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","volume-title":"Automata, Languages, and Machines","author":"Eilenberg Samuel","year":"1974"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1147\/rd.91.0047"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90230-Q"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"rf8","first-page":"331","volume":"20","author":"Kaplan Ronald M.","journal-title":"Computational Linguistics"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1162\/089120100561647"},{"key":"rf15","volume":"24","author":"Knight Kevin","journal-title":"Computational Linguistics"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(77)90056-1"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39886-8_29"},{"key":"rf22","unstructured":"Fernando C. N.\u00a0Pereira and Michael D.\u00a0Riley, Finite-State Language Processing, eds. Emmanuel\u00a0Roche and Yves\u00a0Schabes (MIT Press, Cambridge, MA, USA, 1997)\u00a0pp. 431\u2013453."},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1946-08555-9"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1147\/rd.32.0114"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:41:13Z","timestamp":1565124073000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":13,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,4]]}},"alternative-id":["10.1142\/S0129054108005760"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005760","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}