{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:36:15Z","timestamp":1725888975195},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602516"},{"type":"electronic","value":"9783319602523"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-60252-3_4","type":"book-chapter","created":{"date-parts":[[2017,6,2]],"date-time":"2017-06-02T14:59:13Z","timestamp":1496415553000},"page":"45-62","source":"Crossref","is-referenced-by-count":5,"title":["Applications of Transducers in Independent Languages, Word Distances, Codes"],"prefix":"10.1007","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,3]]},"reference":[{"issue":"2","key":"4_CR1","first-page":"117","volume":"8","author":"C Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Efficient algorithms for testing the twins property. J. Automata Lang. Comb. 8(2), 117\u2013144 (2003)","journal-title":"J. Automata Lang. Comb."},{"issue":"1","key":"4_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":"4_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":"4_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, Cambridge (2009)"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(91)90260-9","volume":"84","author":"V Bruy\u00e8re","year":"1991","unstructured":"Bruy\u00e8re, V.: Maximal codes with bounded deciphering delay. Theoret. Comput. Sci. 84, 53\u201376 (1991)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"4_CR6","first-page":"141","volume":"8","author":"C Calude","year":"2002","unstructured":"Calude, C., Salomaa, K., Yu, S.: Additive distances and quasi-distances between words. J. Univ. Comput. Sci. 8(2), 141\u2013152 (2002)","journal-title":"J. Univ. Comput. Sci."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.tcs.2011.12.024","volume":"429","author":"M Daley","year":"2012","unstructured":"Daley, M., J\u00fcrgensen, H., Kari, L., Mahalingam, K.: Relativized codes. Theoret. Comput. Sci. 429, 54\u201364 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR8","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 Inf. 40, 491\u2013527 (2004)","journal-title":"Acta Inf."},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1142\/S0129054112400059","volume":"23","author":"K Dudzinski","year":"2012","unstructured":"Dudzinski, K., Konstantinidis, S.: Formal descriptions of code properties: decidability, complexity, implementation. Int. J. Found. Comput. Sci. 23(1), 67\u201385 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1051\/ita\/1986200100891","volume":"20","author":"A Ehrenfeucht","year":"1985","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Each regular code is included in a maximal regular code. RAIRO Inform. Th\u00e9or. Appl. 20, 89\u201396 (1985)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"4_CR11","unstructured":"FAdo: Tools for formal languages manipulation. http:\/\/fado.dcc.fc.up.pt\/ . Accessed Apr 2017"},{"issue":"2","key":"4_CR12","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":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-31653-1_9","volume-title":"Developments in Language Theory","author":"Y-S Han","year":"2012","unstructured":"Han, Y.-S., Ko, S.-K., Salomaa, K.: Computing the edit-distance between a regular language and a context-free language. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 85\u201396. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31653-1_9"},{"key":"4_CR14","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, Boston (1979)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24628-2_8","volume-title":"DNA Computing","author":"N Jonoska","year":"2004","unstructured":"Jonoska, N., Mahalingam, K.: Languages of DNA based code words. In: Chen, J., Reif, J. (eds.) DNA 2003. LNCS, vol. 2943, pp. 61\u201373. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24628-2_8"},{"key":"4_CR16","first-page":"117","volume":"14","author":"H J\u00fcrgensen","year":"1999","unstructured":"J\u00fcrgensen, H.: Syntactic monoids of codes. Acta Cybern. 14, 117\u2013133 (1999)","journal-title":"Acta Cybern."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"J\u00fcrgensen, H., Konstantinidis, S.: Codes. In: Rozenberg and Salomaa [36], pp. 511\u2013607 (1997)","DOI":"10.1007\/978-3-642-59136-5_8"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kamabe, H.: Outfix-free and intercode constraints for DNA sequences. In: Proceedings of 2011 IEEE International Symposium on Information Theory, pp. 1574\u20131578 (2011)","DOI":"10.1109\/ISIT.2011.6033809"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-45711-9_21","volume-title":"Formal and Natural Computing","author":"L Kari","year":"2002","unstructured":"Kari, L., Kitto, R., Thierrin, G.: Codes, involutions, and DNA encodings. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 376\u2013393. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45711-9_21"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-319-19225-3_12","volume-title":"Descriptional Complexity of Formal Systems","author":"L Kari","year":"2015","unstructured":"Kari, L., Konstantinidis, S., Kopecki, S.: Transducer descriptions of DNA code properties and undecidability of antimorphic problems. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 141\u2013152. Springer, Cham (2015). doi: 10.1007\/978-3-319-19225-3_12"},{"key":"4_CR21","unstructured":"Kari, L., Konstantinidis, S., Kopecki, S., Yang, M.: An efficient algorithm for computing the edit distance of a regular language via input-altering transducers. CoRR abs\/1406.1041 (2014). http:\/\/arxiv.org\/abs\/1406.1041"},{"key":"4_CR22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/j.tcs.2004.12.032","volume":"334","author":"L Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: On properties of bond-free DNA languages. Theoret. Comput. Sci. 334, 131\u2013159 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR23","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. J. Univ. Comput. Sci. 8, 278\u2013291 (2002)","journal-title":"J. Univ. Comput. Sci."},{"key":"4_CR24","unstructured":"Konstantinidis, S., Mastnak, M.: Embedding rationally independent languages into maximal ones. J. Automata Lang. Comb. (2017, to appear)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-40946-7_16","volume-title":"Implementation and Application of Automata","author":"S Konstantinidis","year":"2016","unstructured":"Konstantinidis, S., Meijer, C., Moreira, N., Reis, R.: Implementation of code properties via transducers. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 189\u2013201. Springer, Cham (2016). doi: 10.1007\/978-3-319-40946-7_16"},{"key":"4_CR26","unstructured":"Konstantinidis, S., Moreira, N., Reis, R.: Generating error control codes with automata and transducers. In: Bordihn, H., Freund, R., Nagy, B., Vaszil, G. (eds.) Proceedings of NCMA 2016, pp. 211\u2013226. No. 321 in \u00d6sterreichische Computer Gesellschaft (2016)"},{"issue":"4","key":"4_CR27","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-2010-287","volume":"101","author":"S Konstantinidis","year":"2010","unstructured":"Konstantinidis, S., Silva, P.V.: Computing maximal error-detecting capabilities and distances of regular languages. Fundam. Inf. 101(4), 257\u2013270 (2010)","journal-title":"Fundam. Inf."},{"key":"4_CR28","unstructured":"Kopecki, S.: Personal communication (2013)"},{"key":"4_CR29","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0304-3975(00)00277-2","volume":"262","author":"NH Lam","year":"2001","unstructured":"Lam, N.H.: Finite maximal solid codes. Theoret. Comput. Sci. 262, 333\u2013347 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Mateescu, A., Salomaa, A.: Formal languages: an introduction and a synopsis. In: Rozenberg and Salomaa [36], pp. 1\u201339 (1997)","DOI":"10.1007\/978-3-642-59136-5_1"},{"key":"4_CR31","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/SURV.2010.020110.00079","volume":"12","author":"H Mercier","year":"2010","unstructured":"Mercier, H., Bhargava, V.K., Tarokh, V.: A survey of error-correcting codes for channels with symbol synchronization errors. IEEE Commun. Surv. Tutor. 12, 87\u201396 (2010)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"4_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-40946-7_19","volume-title":"Implementation and Application of Automata","author":"T Ng","year":"2016","unstructured":"Ng, T.: Prefix distance between regular languages. In: Han, Y.-S., Salomaa, K. (eds.) CIAA 2016. LNCS, vol. 9705, pp. 224\u2013235. Springer, Cham (2016). doi: 10.1007\/978-3-319-40946-7_19"},{"key":"4_CR33","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.jcss.2009.08.002","volume":"76","author":"A Okhotin","year":"2010","unstructured":"Okhotin, A.: Decision problems for language equations. J. Comput. Syst. Sci. 76, 251\u2013266 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"9","key":"4_CR34","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. Inf. Theory 59(9), 5935\u20135943 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2000.2914","volume":"165","author":"G Pighizzini","year":"2001","unstructured":"Pighizzini, G.: How hard is computing the edit distance? Inf. Comput. 165, 1\u201313 (2001)","journal-title":"Inf. Comput."},{"volume-title":"Handbook of Formal Languages","year":"1997","key":"4_CR36","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. I. Springer, Berlin (1997)"},{"key":"4_CR37","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, Berlin (2009)"},{"key":"4_CR38","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":"4_CR39","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","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). LNM, vol. 586, pp. 180\u2013188. Springer, Heidelberg (1977). doi: 10.1007\/BFb0087133"},{"key":"4_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/11560647_2","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2005","author":"DL Van","year":"2005","unstructured":"Van, D.L., Hung, K., Huy, P.T.: Codes and length-increasing transitive binary relations. In: Hung, D., Wirsing, M. (eds.) ICTAC 2005. LNCS, vol. 3722, pp. 29\u201348. Springer, Heidelberg (2005). doi: 10.1007\/11560647_2"},{"key":"4_CR41","unstructured":"Vaucanson: The vaucanson project. http:\/\/vaucanson-project.org\/ . Accessed Apr 2017"},{"key":"4_CR42","volume-title":"Theory of Computation","author":"D Wood","year":"1987","unstructured":"Wood, D.: Theory of Computation. Harper & Row, New York (1987)"},{"key":"4_CR43","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Rozenberg and Salomaa [36], pp. 41\u2013110 (1997)","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"4_CR44","volume-title":"Languages and Codes","author":"SS Yu","year":"2005","unstructured":"Yu, S.S.: Languages and Codes. Tsang Hai Book Publishing, Taichung (2005)"},{"key":"4_CR45","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.tcs.2015.08.034","volume":"608","author":"R Zaccagnino","year":"2015","unstructured":"Zaccagnino, R., Zizza, R., Zottoli, C.: Testing DNA code words properties of regular languages. Theoret. Comput. Sci. 608, 84\u201397 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR46","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(94)00300-8","volume":"145","author":"L Zhang","year":"1995","unstructured":"Zhang, L., Shen, Z.: Completion of recognizable bifix codes. Theoret. Comput. Sci. 145, 345\u2013355 (1995)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60252-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,9]],"date-time":"2020-10-09T09:31:51Z","timestamp":1602235911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60252-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602516","9783319602523"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60252-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}