{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:43:58Z","timestamp":1725493438598},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_23","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"243-252","source":"Crossref","is-referenced-by-count":1,"title":["Multi-grain Relations"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Barth\u00e9lemy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Koskenniemi, K.: Two-level morphology: a general computational model for word-form recognition and production. Technical Report\u00a011, Department of General Linguistics, University of Helsinki (1983)","DOI":"10.3115\/980491.980529"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Sproat, R.: Morphology and Computation. The MIT Press, Cambridge, Massachusetts (1992)","DOI":"10.7551\/mitpress\/4775.001.0001"},{"key":"23_CR3","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":"23_CR4","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":"23_CR5","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997) release (September 6, 2005) Available on http:\/\/www.grappa.univ-lille3.fr\/tata"},{"issue":"3","key":"23_CR6","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":"23_CR7","unstructured":"Yli-Jyr\u00e4, A.M., Koskenniemi, K.: Compiling contextual restrictions on strings into finite-state automata. In: Proceedings of the Eindhoven FASTAR Days 2004, Eindhoven, The Netherlands (September 3\u20134, 2004)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M. Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: Weighted finite-state transducers in speech recognition. Computer Speech and Language\u00a016, 69\u201388 (2002)","journal-title":"Computer Speech and Language"},{"key":"23_CR9","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de theorie des automates. \u00c9ditions Vuibert (Paris, France) (2003)"}],"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\/978-3-540-76336-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:09Z","timestamp":1619520489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_23","relation":{},"subject":[]}}