{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:23Z","timestamp":1725455423838},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016249","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"256-263","source":"Crossref","is-referenced-by-count":3,"title":["Unique decipherability for partially commutative alphabet (extended abstract)"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0020-0190(84)90020-6","volume":"18","author":"A. Apostolico","year":"1984","unstructured":"A. Apostolico, R. Giancarlo, Pattern matching machine implementation of a fast test for unique decipherability, Inf. Proc. Letters 18 (1984) 155\u2013158.","journal-title":"Inf. Proc. Letters"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/TIT.1979.1056005","volume":"IT-25","author":"R.M. Capocelli","year":"1979","unstructured":"R.M. Capocelli, A note on uniquely decipherable codes, IEEE Trans. on Inf. Theory IT-25 (1979) 90\u201394.","journal-title":"IEEE Trans. on Inf. Theory"},{"key":"20_CR3","first-page":"103","volume":"IT-9","author":"S. Even","year":"1963","unstructured":"S. Even, Tests for unique decipherability, IEEE Trans. Information Theory IT-9 (1963) 103\u2013112.","journal-title":"IEEE Trans. Information Theory"},{"key":"20_CR4","first-page":"50","volume":"LNCS 176","author":"C.M. Hoffman","year":"1984","unstructured":"C.M. Hoffman, A note on unique decipherability, Proc. 11th MFCS, LNCS 176, Springer-Verlag, 1984, 50\u201363.","journal-title":"Proc. 11th MFCS"},{"key":"20_CR5","unstructured":"J.Hopcroft, J. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley, 1969."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"A.Mazurkiewicz, Concurrent programs schemes and their interpretations, DAIMI-PB 78, Aarhus University (1977).","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"D.Perrin, Words over a partially commutative alphabet, in: Combinatorial Algorithms on Words, A.Apostolico and Z.Galil eds., NATO ASI Series, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-82456-2_23"},{"key":"20_CR8","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/TIT.1982.1056535","volume":"IT-28","author":"M. Rodeh","year":"1982","unstructured":"M. Rodeh, A fast test for unique decipherability based on suffix trees, IEEE Trans. Information Theory IT-28 (1982) 648\u2013651.","journal-title":"IEEE Trans. Information Theory"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"W.Rytter, Some properties of trace languages, Fundamenta Informatica (1984).","DOI":"10.3233\/FI-1984-7108"},{"key":"20_CR10","unstructured":"W.Rytter, The space complexity of the unique decipherability problem, to appear in Inform. Proc. Letters."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016249.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T16:06:59Z","timestamp":1626710819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0016249","relation":{},"subject":[]}}