{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:16Z","timestamp":1725491416146},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_13","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"126-136","source":"Crossref","is-referenced-by-count":1,"title":["Multi-tape Automata with Symbol Classes"],"prefix":"10.1007","author":[{"given":"F.","family":"Nicart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. -M.","family":"Champarnaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Cs\u00e1ki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Ga\u00e1l","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Kempe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Palo Alto (2003)"},{"key":"13_CR2","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":"#cr-split#-13_CR3.1","unstructured":"Ga\u00e1l, T.: Extended sequentializaton of transducers, pp. 569-585 (1999)"},{"key":"#cr-split#-13_CR3.2","unstructured":"Publicationes Mathematicae Debrecen, Supplement 60 (2002)"},{"key":"#cr-split#-13_CR4.1","unstructured":"Ga\u00e1l, T., Guingne, F., Nicart, F.: OTHER extension to finite state automata, vol.\u00a065, pp. 535-552 (2002)"},{"key":"#cr-split#-13_CR4.2","unstructured":"Publicationes Mathematicae Debrecen, Supplement 65 (2005)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-45446-2_12","volume-title":"Theoretical Computer Science","author":"D. Giammarresi","year":"2001","unstructured":"Giammarresi, D., Montalbano, R., Wood, D.: Block-deterministic regular languages. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 184\u2013196. Springer, Heidelberg (2001)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-540-30500-2_15","volume-title":"Implementation and Application of Automata","author":"Y.-S. Han","year":"2005","unstructured":"Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 156\u2013166. Springer, Heidelberg (2005)"},{"key":"13_CR7","volume-title":"Constraint satisfaction in logic programming","author":"P. Hentenryck Van","year":"1989","unstructured":"Van Hentenryck, P.: Constraint satisfaction in logic programming. MIT Press, Cambridge (1989)"},{"issue":"3","key":"13_CR8","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(3), 331\u2013378 (1994)","journal-title":"Computational Linguistics"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: The replace operator. In: Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, Boston, Massachusetts, pp. 16\u201323 (1995)","DOI":"10.3115\/981658.981661"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-45089-0_11","volume-title":"Implementation and Application of Automata","author":"A. Kempe","year":"2003","unstructured":"Kempe, A., Baeijs, C., Ga\u00e1l, T., Guingne, F., Nicart, F.: WFSC - A new weighted finite state compiler. In: H. Ibarra, O., Dang, Z. (eds.) CIAA 2003. LNCS, vol.\u00a02759, pp. 108\u2013119. Springer, Heidelberg (2003)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/11605157_16","volume-title":"Implementation and Application of Automata","author":"A. Kempe","year":"2006","unstructured":"Kempe, A., Champarnaud, J.-M., Eisner, J., Guingne, F., Nicart, F.: A class of rational n-WFSM auto-intersections. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol.\u00a03845, pp. 188\u2013198. Springer, Heidelberg (2006)"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Koskenniemi, K.: Two-level Morphology: A General Computational Model for Word-Form Recognition and Production, PhD thesis at the University of Helsinki, Department of General Linguistics (1983)","DOI":"10.3115\/980491.980529"},{"key":"13_CR13","unstructured":"Nicart, F.: Conception de mod\u00e8les g\u00e9n\u00e9riques pour les machines \u00e0 \u00e9tats finis, Th\u00e8se de doctorat de l\u2019Universit\u00e9 de Rouen (2005)"},{"issue":"3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1012291501330","volume":"4","author":"G. Noord van","year":"2001","unstructured":"van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars\u00a04(3), 263\u2013286 (2001)","journal-title":"Grammars"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:19:55Z","timestamp":1558271995000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11812128_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}