{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:40:07Z","timestamp":1736289607583,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_16","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"188-198","source":"Crossref","is-referenced-by-count":5,"title":["A Class of Rational n-WFSM Auto-intersections"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Kempe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason","family":"Eisner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Guingne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florent","family":"Nicart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03, 114\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development\u00a09, 47\u201368 (1965)","journal-title":"IBM Journal of Research and Development"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Kay, M.: Nonconcatenative finite-state morphology. In: Proc. 3rd Int. Conf. EACL, Copenhagen, Denmark, pp. 2\u201310 (1987)","DOI":"10.3115\/976858.976860"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(91)90356-7","volume":"78","author":"T. Harju","year":"1991","unstructured":"Harju, T., Karhum\u00e4ki, J.: The equivalence problem of multitape finite automata. Theoretical Computer Science\u00a078, 347\u2013355 (1991)","journal-title":"Theoretical Computer Science"},{"key":"16_CR5","first-page":"331","volume":"20","author":"R.M. Kaplan","year":"1994","unstructured":"Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics\u00a020, 331\u2013378 (1994)","journal-title":"Computational Linguistics"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1162\/089120100561647","volume":"26","author":"G.A. Kiraz","year":"2000","unstructured":"Kiraz, G.A.: Multitiered nonlinear morphology using multitape finite automata: a case study on Syriac and Arabic. Computational Lingistics\u00a026, 77\u2013105 (2000)","journal-title":"Computational Lingistics"},{"key":"16_CR7","first-page":"64","volume-title":"Proc. Eindhoven FASTAR Days. Number 04\u201340 in TU\/e CS TR","author":"A. Kempe","year":"2004","unstructured":"Kempe, A., Champarnaud, J.M., Eisner, J.: A note on join and auto-intersection of n-ary rational relations. In: Watson, B., Cleophas, L. (eds.) Proc. Eindhoven FASTAR Days. Number 04\u201340 in TU\/e CS TR, pp. 64\u201378. Eindhoven, Netherlands (2004)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized rational relations of finite and infinite words. Theoretical Computer Science\u00a0108, 45\u201382 (1993)","journal-title":"Theoretical Computer Science"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44977-9_1","volume-title":"Implementation and Application of Automata","author":"M. Mohri","year":"2003","unstructured":"Mohri, M.: Edit-distance of weighted automata. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 1\u201323. Springer, Heidelberg (2003)"},{"key":"16_CR10","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, San Diego (1974)"},{"key":"16_CR11","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69959-7","volume-title":"Semirings, Automata, Languages","author":"W. Kuich","year":"1986","unstructured":"Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol.\u00a05. Springer, Berlin, Germany (1986)"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0031388","volume-title":"Automata Implementation","author":"M. Mohri","year":"1998","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: A rational design for a weighted finite-state transducer library. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol.\u00a01436, pp. 144\u2013158. Springer, Heidelberg (1998)"},{"key":"16_CR13","unstructured":"Kempe, A., Guingne, F., Nicart, F.: Algorithms for weighted multi-tape automata. Research report 2004\/031, Xerox Research Centre Europe, Meylan, France (2004)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: On n-tape finite state acceptors. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 76\u201381 (1964)","DOI":"10.1109\/SWCT.1964.17"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Eisner, J.: Parameter estimation for probabilistic finite-state transducers. In: Proc. of the 40th Annual Meeting of the Association for Computational Linguistics, Philadelphia (2002)","DOI":"10.3115\/1073083.1073085"},{"key":"16_CR16","unstructured":"Kempe, A.: NLP applications based on weighted multi-tape automata. In: Proc. 11th Conf. TALN, Fes, Morocco, pp. 253\u2013258 (2004)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:04:51Z","timestamp":1736287491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11605157_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}