{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:25Z","timestamp":1725664225621},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606932"},{"type":"electronic","value":"9783540492801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60693-9_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:54:04Z","timestamp":1330289644000},"page":"199-204","source":"Crossref","is-referenced-by-count":1,"title":["Church-Rosser codes"],"prefix":"10.1007","author":[{"given":"Vladimir A.","family":"Oleshchuk","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"23_CR1","first-page":"1","volume":"5","author":"A.V. Anisimov","year":"1981","unstructured":"A.V. Anisimov, Finite-automata semigroup mappings, Cybernetics, 5 (1981) 1\u20137.","journal-title":"Cybernetics"},{"key":"23_CR2","unstructured":"J. Berstel, Congruences plus que parfaites et langages alg\u00e9brique, S\u00e9minaire d'Informatique Th\u00e9orique, Institut de Programmation (1976\u201377) 123\u2013147."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"J. Berstel and L. Boasson, Context-free languages, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Elsevier Science Publishers B.V., 1990, 59\u2013102.","DOI":"10.1016\/B978-0-444-88074-1.50007-X"},{"key":"23_CR4","unstructured":"J. Berstel and D. Perrin, Theory of Codes, Academic Press, 1985."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R. V. Book","year":"1982","unstructured":"R. V. Book, Confluent and other types of Thue systems, Journal of ACM, 29 (1982) 171\u2013183.","journal-title":"Journal of ACM"},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","volume":"3","author":"R. V. Book","year":"1987","unstructured":"R. V. Book, Thue systems as rewriting systems, J. Symb. Comp. 3 (1987) 39\u201368.","journal-title":"J. Symb. Comp."},{"key":"23_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R. V. Book","year":"1993","unstructured":"R. V. Book and F. Otto, String-Rewriting Systems, Springer: New-York, 1993."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(85)90008-8","volume":"35","author":"D. Kapur","year":"1985","unstructured":"D. Kapur, M. Krishnamoorthy, R. McNaughton and R. Narendran, An O(\u00a6T\u00a6 3 ) algorithm for testing the Church-Rosser property of Thue systems, Theor. Comp. Sci. 35 (1985) 109\u2013114.","journal-title":"Theor. Comp. Sci."},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"P. Narendran, C. O'Dunlaing and H. Rolletschek, Complexity of certain decision problems about congruential languages, J. Comp. Syst. Sci. 30, 343\u2013358.","DOI":"10.1016\/0022-0000(85)90051-0"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/BFb0030841","volume":"959","author":"V. A. Oleshchuk","year":"1995","unstructured":"V. A. Oleshchuk, On public-key cryptosystem based on Church-Rosser stringrewriting systems, Computing and Combinatorics: First Annual International Conference (COCOON'95). Proceedings. LNCS 959 (1995) 264\u2013269.","journal-title":"Computing and Combinatorics: First Annual International Conference (COCOON'95). Proceedings. LNCS"},{"key":"23_CR11","first-page":"104","volume":"8","author":"A. Sardinas","year":"1953","unstructured":"A. Sardinas and G. Patterson, A necessary and sufficient condition for the unique decomposition of coded messages, I.R.E. Int. Conv. Rec. 8 (1953) 104\u2013108.","journal-title":"I.R.E. Int. Conv. Rec."}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60693-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:30Z","timestamp":1605646890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60693-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606932","9783540492801"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60693-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}