{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:34:02Z","timestamp":1725482042838},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646945"},{"type":"electronic","value":"9783540691044"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0031383","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:38:17Z","timestamp":1134286697000},"page":"87-103","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-tape automata for speech and language systems: A prolog implementation"],"prefix":"10.1007","author":[{"given":"George Anton","family":"Kiraz","sequence":"first","affiliation":[]},{"given":"Edmund","family":"Grimley-Evans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,29]]},"reference":[{"key":"8_CR1","unstructured":"Carlsson, M. 1996. Personal communication to Edmund Grimley-Evans and posting to the Usenet news groups comp. lang. prolog (16 july 1996)."},{"key":"8_CR2","unstructured":"Eilenberg, S. 1974. Automata, Languages, and Machines, volume A. Academic Press."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C. Elgot","year":"1965","unstructured":"Elgot, C. and J. Mezei. 1965. On relations defined by generalized finite automata. IBM Journal of Research and Development, 9:47\u201368.","journal-title":"IBM Journal of Research and Development"},{"key":"8_CR4","unstructured":"Hopcroft, J. and J. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley."},{"issue":"3","key":"8_CR5","first-page":"331","volume":"20","author":"R. Kaplan","year":"1994","unstructured":"Kaplan, R. and M. Kay. 1994. Regular models of phonological rule systems. Computational Linguistics, 20(3):331\u201378.","journal-title":"Computational Linguistics"},{"key":"8_CR6","unstructured":"Kay, M. 1987. Nonconcatenative finite-state morphology. In Proceedings of the Third Conference of the European Chapter of the Association for Computational Linguistics, pages 2\u201310."},{"key":"8_CR7","unstructured":"Kiraz, G. 1994. Multi-tape two-level morphology: a case study in Semitic nonlinear morphology. In COLING-94: Papers Presented to the 15th International Conference on Computational Linguistics, volume 1, pages 180\u20136."},{"key":"8_CR8","unstructured":"Kiraz, G. [Forthcoming]. Computational Approach to Nonlinear Morphology: with emphasis on Semitic languages. Cambridge University Press."},{"issue":"5","key":"8_CR9","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"G. Mealy","year":"1955","unstructured":"Mealy, G. 1955. A method for synthesizing sequential circuits. Bell System Technical Journal, 34(5):1045\u201379.","journal-title":"Bell System Technical Journal"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"Nivat, M. 1968. Transductions des languages de Chomsky. Ann. Inst. Fourier (Grenoble), 18:339\u2013455.","journal-title":"Ann. Inst. Fourier (Grenoble)"},{"key":"8_CR11","unstructured":"O'Keefe, R. 1990. The Craft of Prolog. The MIT Press."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"Rabin, M. and D. Scott. 1959. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114\u201325. Reprinted in Moore, E. (ed.) Sequential Machines. Addison-Wesley, Reading, Massachussetts, 1964, pp. 63-91.","journal-title":"IBM Journal of Research and Development"},{"key":"8_CR13","unstructured":"Raymond, D. and D. Wood. 1996. The Grail papers. Technical report, University of Western Ontario, Department of Computer Science. Technical Report TR-491."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Roche, E., editor. 1997. Finite-State Language Processing. MIT Press.","DOI":"10.7551\/mitpress\/3007.001.0001"},{"key":"8_CR15","unstructured":"Swedish Institute of Computer Science, 1995. SICStus Prolog User's Manual."},{"key":"8_CR16","unstructured":"Watson, B. 1995. Taxonomies and Toolkiis of Regular Language Algorithms. Ph.D. thesis, Technische Universiteit Eindhoven."},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Watson, B. 1996. Implementing and using finite automata toolkits. In ECAI Workshop on Extended Finite-State Models of Language.","DOI":"10.1017\/S135132499700154X"}],"container-title":["Lecture Notes in Computer Science","Automata Implementation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:52:08Z","timestamp":1586613128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646945","9783540691044"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0031383","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"29 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}