{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:46:03Z","timestamp":1725860763964},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319409450"},{"type":"electronic","value":"9783319409467"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40946-7_16","type":"book-chapter","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T11:52:20Z","timestamp":1467719540000},"page":"189-201","source":"Crossref","is-referenced-by-count":2,"title":["Implementation of Code Properties via Transducers"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[]},{"given":"Casey","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"Nelma","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Rog\u00e9rio","family":"Reis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,6]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-02979-0_10","volume-title":"Implementation and Application of Automata","author":"A Almeida","year":"2009","unstructured":"Almeida, A., Almeida, M., Alves, J., Moreira, N., Reis, R.: FAdo and GUItar: tools for automata manipulation and visualization. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 65\u201374. Springer, Heidelberg (2009)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0304-3975(01)00214-6","volume":"292","author":"MP B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theoret. Comput. Sci. 292(1), 45\u201363 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B.G. Teubner, Stuttgart (1979)"},{"key":"16_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139195768","volume-title":"Codes and Automata","author":"J Berstel","year":"2009","unstructured":"Berstel, J., Perrin, D., Reutenauer, C.: Codes and Automata. Cambridge University Press, New York (2009)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/11605157_10","volume-title":"Implementation and Application of Automata","author":"T Claveirole","year":"2006","unstructured":"Claveirole, T., Lombardy, S., O\u2019Connor, S., Pouchet, L.-N., Sakarovitch, J.: Inside vaucanson. In: Farr\u00e9, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 116\u2013128. Springer, Heidelberg (2006)"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s00236-004-0140-4","volume":"40","author":"M Domaratzki","year":"2004","unstructured":"Domaratzki, M.: Trajectory-based codes. Acta Informatica 40, 491\u2013527 (2004)","journal-title":"Acta Informatica"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/j.tcs.2006.08.022","volume":"366","author":"M Domaratzki","year":"2006","unstructured":"Domaratzki, M., Salomaa, K.: Codes defined by multiple sets of trajectories. Theoret. Comput. Sci. 366, 182\u2013193 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"16_CR8","first-page":"67","volume":"23","author":"K Dudzinski","year":"2012","unstructured":"Dudzinski, K., Konstantinidis, S.: Formal descriptions of code properties: decidability, complexity, implementation. IJFCS 23(1), 67\u201385 (2012)","journal-title":"IJFCS"},{"key":"16_CR9","unstructured":"FAdo: Tools for formal languages manipulation. http:\/\/fado.dcc.fc.up.pt\/"},{"key":"16_CR10","unstructured":"Grail: Grail+. http:\/\/www.csit.upei.ca\/~ccampeanu\/Grail\/"},{"issue":"2","key":"16_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"26","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Tech. J. 26(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Tech. J."},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-1-4613-9323-8_19","volume-title":"Sequences II, Methods in Communication, Security, and Computer Science","author":"T Head","year":"1993","unstructured":"Head, T., Weber, A.: Deciding code related properties by means of finite transducers. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds.) Sequences II, Methods in Communication, Security, and Computer Science, pp. 260\u2013272. Springer, New York (1993)"},{"key":"16_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"16_CR14","first-page":"117","volume":"14","author":"H J\u00fcrgensen","year":"1999","unstructured":"J\u00fcrgensen, H.: Syntactic monoids of codes. Acta Cybernetica 14, 117\u2013133 (1999)","journal-title":"Acta Cybernetica"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg and Salomaa [25], pp. 511\u2013607","DOI":"10.1007\/978-3-642-59136-5_8"},{"key":"16_CR16","first-page":"278","volume":"8","author":"S Konstantinidis","year":"2002","unstructured":"Konstantinidis, S.: Transducers and the properties of error-detection, error-correction and finite-delay decodability. JUCS 8, 278\u2013291 (2002)","journal-title":"JUCS"},{"key":"16_CR17","unstructured":"Konstantinidis, S., Meijer, C., Moreira, N., Reis, R.: Symbolic manipulation of code properties. Computing Research Repository (2015). arXiv:1504.04715v1"},{"key":"16_CR18","unstructured":"Konstantinidis, S., Moreira, N., Reis, R.: Channels with synchronization\/substitution errors and computation of error control codes. Computing Research Repository (2016). arXiv:1601.06312v1"},{"key":"16_CR19","unstructured":"LaSer: Independent LAnguage SERver. http:\/\/laser.cs.smu.ca\/independence\/"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Mateescu, A., Salomaa, A.: Formal languages: an introduction and a synopsis. In: Rozenberg and Salomaa [25], pp. 1\u201339","DOI":"10.1007\/978-3-642-59136-5_1"},{"key":"16_CR21","unstructured":"Nivat, M.: Elements de la th\u00e9orie g\u00e9n\u00e9rale des cod\u00e9s. In: Automata Theory, pp. 278\u2013294 (1966)"},{"key":"16_CR22","unstructured":"OpenFst: OpenFst Library. http:\/\/www.openfst.org\/"},{"issue":"9","key":"16_CR23","doi-asserted-by":"crossref","first-page":"5935","DOI":"10.1109\/TIT.2013.2264825","volume":"59","author":"F Paluncic","year":"2013","unstructured":"Paluncic, F., Abdel-Ghaffar, K., Ferreira, H.: Insertion\/deletion detecting codes and the boundary problem. IEEE Trans. Info. Theory 59(9), 5935\u20135943 (2013)","journal-title":"IEEE Trans. Info. Theory"},{"issue":"4","key":"16_CR24","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1006\/jsco.1994.1023","volume":"17","author":"D Raymond","year":"1994","unstructured":"Raymond, D., Wood, D.: Grail: a C++ library for automata and expressions. J. Symbolic Comput. 17(4), 341\u2013350 (1994)","journal-title":"J. Symbolic Comput."},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"16_CR25","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. I. Springer-Verlag, Berlin (1997)"},{"key":"16_CR26","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, New York (2009)"},{"key":"16_CR27","first-page":"104","volume":"8","author":"AA Sardinas","year":"1953","unstructured":"Sardinas, A.A., Patterson, G.W.: A necessary and sufficient condition for the unique decomposition of coded messages. IRE Int. Conven. Rec. 8, 104\u2013108 (1953)","journal-title":"IRE Int. Conven. Rec."},{"key":"16_CR28","volume-title":"Free Monoids and Languages","author":"HJ Shyr","year":"1991","unstructured":"Shyr, H.J.: Free Monoids and Languages, 2nd edn. Hon Min Book Company, Taichung (1991)","edition":"2"},{"key":"16_CR29","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BFb0087133","volume-title":"S\u00e9minaire d\u2019Alg\u00e8bre Paul Dubreil Paris 1975\u20131976 (29\u00e8me Ann\u00e9e)","author":"HJ Shyr","year":"1977","unstructured":"Shyr, H.J., Thierrin, G.: Codes and binary relations. In: Malliavin, M.P. (ed.) S\u00e9minaire d\u2019Alg\u00e8bre Paul Dubreil Paris 1975\u20131976 (29\u00e8me Ann\u00e9e). Lecture Notes in Mathematics, vol. 586, pp. 180\u2013188. Springer, Heidelberg (1977)"},{"key":"16_CR30","unstructured":"Vaucanson: The Vaucanson Project. http:\/\/vaucanson-project.org\/"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-642-39274-0_3","volume-title":"Implementation and Application of Automata","author":"M Veanes","year":"2013","unstructured":"Veanes, M.: Applications of symbolic finite automata. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol. 7982, pp. 16\u201323. Springer, Heidelberg (2013)"},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg and Salomaa [25], pp. 41\u2013110","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40946-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,23]],"date-time":"2020-09-23T12:22:05Z","timestamp":1600863725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40946-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319409450","9783319409467"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40946-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}