{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:50:30Z","timestamp":1740099030952,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773124"},{"type":"electronic","value":"9783319773131"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77313-1_11","type":"book-chapter","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:20:49Z","timestamp":1520371249000},"page":"143-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A General Class of Monoids Supporting Canonisation and Minimisation of (Sub)sequential Transducers"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Gerdjikov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"issue":"1\u20132","key":"11_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-3975(96)00319-2","volume":"191","author":"D Breslauer","year":"1998","unstructured":"Breslauer, D.: The suffix tree of a tree and minimizing sequential transducers. Theor. Comput. Sci. 191(1\u20132), 131\u2013144 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C Choffrut","year":"1977","unstructured":"Choffrut, C.: Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationelles. Theor. Comput. Sci. 5, 325\u2013338 (1977)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Daviaud, L., Reynier, P.A., Talbot, J.M.: A generalised twinning property for minimisation of cost register automata. In: Proceedings - Symposium on Logic in Computer Science, pp. 857\u2013866 (2016)","DOI":"10.1145\/2933575.2934549"},{"key":"11_CR4","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines. Academic Press, New York (1974)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-319-53733-7_28","volume-title":"Language and Automata Theory and Applications","author":"S Gerdjikov","year":"2017","unstructured":"Gerdjikov, S., Mihov, S.: Over which monoids is the transducer determinization procedure applicable? In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 380\u2013392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_28"},{"key":"11_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical Inference: Learning Automata and Grammars","author":"C Higuera de la","year":"2010","unstructured":"de la Higuera, C.: Grammatical Inference: Learning Automata and Grammars. Cambridge University Press, Cambridge (2010)"},{"key":"11_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"key":"11_CR8","unstructured":"Jardine, A., Chandlee, J., Eyraud, R., Heinz, J.: Very efficient learning of structured classes of subsequential functions from positive data. In: Proceedings of the 12th International Conference on Grammatical Inference, vol. 34, pp. 94\u2013108 (2014)"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S1351324996001234","volume":"2","author":"M Mohri","year":"1996","unstructured":"Mohri, M.: On some applications of finite-state automata theory to natural language processing. J. Nat. Lang. Eng. 2, 1\u201320 (1996)","journal-title":"J. Nat. Lang. Eng."},{"issue":"2","key":"11_CR10","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(98)00115-7","volume":"234","author":"M Mohri","year":"2000","unstructured":"Mohri, M.: Minimization algorithms for sequential transducers. Theor. Comput. Sci. 234, 177\u2013201 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7551\/mitpress\/3007.001.0001","volume-title":"Finite-State Language Processing","author":"E Roche","year":"1997","unstructured":"Roche, E., Schabes, Y.: Introduction. In: Roche, E., Schabes, Y. (eds.) Finite-State Language Processing, pp. 1\u201366. MIT Press, Cambridge (1997)"},{"key":"11_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195218","volume-title":"Elements of Automata Theory","author":"J Sakarovitch","year":"2009","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T05:27:03Z","timestamp":1570858023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}