{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:56Z","timestamp":1725491456061},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_8","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T03:58:11Z","timestamp":1189569491000},"page":"48-59","source":"Crossref","is-referenced-by-count":2,"title":["Coding Partitions: Regularity, Maximality and Global Ambiguity"],"prefix":"10.1007","author":[{"given":"Marie-Pierre","family":"B\u00e9al","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Burderi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.tcs.2006.01.043","volume":"356","author":"M.-P. B\u00e9al","year":"2006","unstructured":"B\u00e9al, M.-P., Perrin, D.: Codes, unambiguous automata and sofic systems. Theoret. Comput. Sci.\u00a0356, 6\u201313 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR2","series-title":"Pure and Applied Mathematics","volume-title":"Theory of codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of codes, Orlando, FL. Pure and Applied Mathematics, vol.\u00a0117. Academic Press Inc, San Diego (1985), \n                    \n                      http:\/\/www-igm.univ-mlv.fr\/~berstel\/LivreCodes\/Codes.html"},{"key":"8_CR3","unstructured":"Burderi, F., Restivo, A.: Coding partitions, Discret. Math. Theor. Comput. Sci (to appear)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"1534","DOI":"10.1109\/ISIT.2005.1523601","volume-title":"ISIT 2005","author":"M. Dalai","year":"2005","unstructured":"Dalai, M., Leonardi, R.: Non prefix-free codes for constrained sequences. In: ISIT 2005. International Symposium on Information Theory, pp. 1534\u20131538. IEEE, New York (2005)"},{"key":"8_CR5","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"G\u00f6nen\u00e7, G.: Unique decipherability of codes with constraints with application to syllabification of Turkish words. In: COLING 1973: Computational And Mathematical Linguistics: Proceedings of the International Conference on Computational Linguistics, vol. 1, pp. 183\u2013193 (1973)","DOI":"10.3115\/992532.992549"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0022-4049(98)00019-X","volume":"141","author":"F. Guzm\u00e1n","year":"1999","unstructured":"Guzm\u00e1n, F.: Decipherability of codes. J. Pure Appl. Algebra\u00a0141, 13\u201335 (1999)","journal-title":"J. Pure Appl. Algebra"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00254-0","volume":"218","author":"W.P.J. Karhum\u00e4ki","year":"1999","unstructured":"Karhum\u00e4ki, W.P.J., Rytter, W.: Generalized factorizations of words and their algorithmic properties. Theoret. Comput. Sci.\u00a0218, 123\u2013133 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/TIT.1986.1057217","volume":"32","author":"A. Lempel","year":"1986","unstructured":"Lempel, A.: On multiset decipherable codes. IEEE Trans. Inform. Theory\u00a032, 714\u2013716 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/18.30991","volume":"35","author":"A. Restivo","year":"1989","unstructured":"Restivo, A.: A note on multiset decipherable codes. IEEE Trans. Inform. Theory\u00a035, 662\u2013663 (1989)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR11","volume-title":"\u00c9l\u00e9ments de th\u00e9orie des automates","author":"J. Sakarovitch","year":"2003","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates, Vuibert, Paris. Cambridge University Press, Cambridge (English translation to appear) (2003)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73208-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:34:48Z","timestamp":1558474488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}