{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:21:04Z","timestamp":1648750864466},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,8]]},"abstract":"<jats:p> Rational relations are a powerful model used in many domains such as natural language processing. In this article, we propose a new model of finite state automata: multi-tape automata with symbol classes and identity or non-identity constraints. This model generalizes classical multi-tape automata, as well as automata and transducers with extended alphabet. We define this model in terms of a constraint satisfaction problem and discuss a problem occurring when handling the projection operation. Finally, we describe its implementation and results of a performance test. <\/jats:p>","DOI":"10.1142\/s0129054107005017","type":"journal-article","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T07:29:46Z","timestamp":1185780586000},"page":"847-858","source":"Crossref","is-referenced-by-count":0,"title":["LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES"],"prefix":"10.1142","volume":"18","author":[{"given":"FLORENT","family":"NICART","sequence":"first","affiliation":[{"name":"LLI\u2013IRISA, ENSSAT, 6 rue de K\u00e9rampont, 22305 Lannion Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEAN-MARC","family":"CHAMPARNAUD","sequence":"additional","affiliation":[{"name":"LITIS (Universit\u00e9 de Rouen), Avenue de l'Universit\u00e9, 76800 Saint Etienne du Rouvray, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TIBOR","family":"CS\u00c1KI","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Institute of Mathematics and Informatics, University of Debrecen, H-4010, Debrecen, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TAM\u00c1S","family":"GA\u00c1L","sequence":"additional","affiliation":[{"name":"Xerox Research Centre Europe \u2013 Grenoble Laboratory, 6 chemin de Maupertuis, 38240 Meylan, 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, 38240 Meylan, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Finite State Morphology","author":"Beesley Kenneth R.","year":"2003"},{"key":"rf2","volume-title":"Automata, Languages, and Machines","author":"Eilenberg Samuel","year":"1974"},{"key":"rf5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-45446-2_12","volume":"2202","author":"Giammarresi Dora","year":"2001"},{"key":"rf6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-540-30500-2_15","volume":"3317","author":"Han Yo-Sub","year":"2004"},{"key":"rf7","volume-title":"Constraint satisfaction in logic programming","author":"Van Hentenryck Pascal","year":"1989"},{"key":"rf8","first-page":"331","volume":"20","author":"Kaplan Ronald M.","journal-title":"Computational Linguistics"},{"key":"rf10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/3-540-45089-0_11","volume":"2759","author":"Kempe Andr\u00e9","year":"2003"},{"key":"rf11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/11605157_16","volume":"3845","author":"Kempe Andr\u00e9","year":"2005"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012291501330"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107005017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:42:28Z","timestamp":1565124148000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":9,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,8]]}},"alternative-id":["10.1142\/S0129054107005017"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005017","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}