{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:21:12Z","timestamp":1742916072539,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030677305"},{"type":"electronic","value":"9783030677312"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-67731-2_28","type":"book-chapter","created":{"date-parts":[[2021,1,20]],"date-time":"2021-01-20T10:07:45Z","timestamp":1611137265000},"page":"389-399","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Normal Sequence Compressed by PPM*\u00a0But Not by Lempel-Ziv 78"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0583-666X","authenticated-orcid":false,"given":"Liam","family":"Jordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Moser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,11]]},"reference":[{"issue":"8","key":"28_CR1","doi-asserted-by":"publisher","first-page":"1592","DOI":"10.1016\/j.jcss.2015.04.007","volume":"81","author":"V Becher","year":"2015","unstructured":"Becher, V., Carton, O., Heiber, P.A.: Normality and automata. J. Comput. Syst. Sci. 81(8), 1592\u20131613 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.04.007","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2013.01.019","volume":"477","author":"V Becher","year":"2013","unstructured":"Becher, V., Heiber, P.A.: Normal numbers and finite automata. Theor. Comput. Sci. 477, 109\u2013116 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.01.019","journal-title":"Theor. Comput. Sci."},{"key":"28_CR3","volume-title":"Text Compression","author":"TC Bell","year":"1990","unstructured":"Bell, T.C., Cleary, J.G., Witten, I.H.: Text Compression. Prentice-Hall Inc., Upper Saddle River, NJ, USA (1990)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Bennett, C.H.: Logical depth and physical complexity. The Universal Turing Machine, A Half-Century Survey, pp. 227\u2013257 (1988)","DOI":"10.1093\/oso\/9780198537748.003.0008"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF03019651","volume":"27","author":"M \u00c9mile Borel","year":"1909","unstructured":"\u00c9mile Borel, M.: Les probabilit\u00e9s d\u00e9nombrables et leurs applications arithm\u00e9tiques. Rendiconti del Circolo Matematico di Palermo (1884\u20131940) 27(1), 247\u2013271 (1909). https:\/\/doi.org\/10.1007\/BF03019651","journal-title":"Rendiconti del Circolo Matematico di Palermo (1884\u20131940)"},{"key":"28_CR6","first-page":"758","volume":"49","author":"NGD Bruijn","year":"1946","unstructured":"Bruijn, N.G.D.: A combinatorial problem. Proc. Koninklijke Nederlandse Academie van Wetenschappen 49, 758\u2013764 (1946)","journal-title":"Proc. Koninklijke Nederlandse Academie van Wetenschappen"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ic.2015.02.001","volume":"241","author":"O Carton","year":"2015","unstructured":"Carton, O., Heiber, P.A.: Normality and two-way automata. Inf. Comput. 241, 264\u2013276 (2015). https:\/\/doi.org\/10.1016\/j.ic.2015.02.001","journal-title":"Inf. Comput."},{"issue":"2\/3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/DCC.1995.515495","volume":"40","author":"JG Cleary","year":"1997","unstructured":"Cleary, J.G., Teahan, W.J.: Unbounded length contexts for PPM. Comput. J. 40(2\/3), 67\u201375 (1997). https:\/\/doi.org\/10.1109\/DCC.1995.515495","journal-title":"Comput. J."},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1109\/TCOM.1984.1096090","volume":"32","author":"JG Cleary","year":"1984","unstructured":"Cleary, J.G., Witten, I.H.: Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. 32(4), 396\u2013402 (1984). https:\/\/doi.org\/10.1109\/TCOM.1984.1096090","journal-title":"IEEE Trans. Commun."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00244-5","volume":"310","author":"J Dai","year":"2004","unstructured":"Dai, J., Lathrop, J., Lutz, J., Mayordomo, E.: Finite-state dimension. Theoretical Comput. Sci. 310, 1\u201333 (2004). https:\/\/doi.org\/10.1016\/S0304-3975(03)00244-5","journal-title":"Theoretical Comput. Sci."},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-73001-9_24","volume-title":"Computation and Logic in the Real World","author":"D Doty","year":"2007","unstructured":"Doty, D., Moser, P.: Feasible depth. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 228\u2013237. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73001-9_24"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-38919-2_16","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"L Jordon","year":"2020","unstructured":"Jordon, L., Moser, P.: On the difference between finite-state and pushdown depth. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 187\u2013198. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_16"},{"key":"28_CR13","doi-asserted-by":"publisher","unstructured":"Lathrop, J.I., Strauss, M.J.: A universal upper bound on the performance of the Lempel-Ziv algorithm on maliciously-constructed data. In: Proceedings of the Compression and Complexity of Sequences, vol. 1997, pp. 123\u2013135 (1997). https:\/\/doi.org\/10.1109\/SEQUEN.1997.666909","DOI":"10.1109\/SEQUEN.1997.666909"},{"issue":"12","key":"28_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1090\/S0002-9904-1934-05988-3","volume":"40","author":"MH Martin","year":"1934","unstructured":"Martin, M.H.: A problem in arrangements. Bull. Amer. Math. Soc. 40(12), 859\u2013864 (1934). https:\/\/doi.org\/10.1090\/S0002-9904-1934-05988-3","journal-title":"Bull. Amer. Math. Soc."},{"issue":"11","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"38","author":"A Moffat","year":"1990","unstructured":"Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. Commun. 38(11), 1917\u20131921 (1990). https:\/\/doi.org\/10.1109\/26.61469","journal-title":"IEEE Trans. Commun."},{"key":"28_CR16","doi-asserted-by":"publisher","unstructured":"Pierce, L.A., Shields, P.C.: Sequences incompressible by slz (lzw), yet fully compressible by ulz. In: Numbers, Information and Complexity, pp. 385\u2013390. Springer (2000). https:\/\/doi.org\/10.1007\/978-1-4757-6048-4_32","DOI":"10.1007\/978-1-4757-6048-4_32"},{"key":"28_CR17","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00289514","volume":"1","author":"C Schnorr","year":"1972","unstructured":"Schnorr, C., Stimm, H.: Endliche Automaten und Zufallsfolgen. Acta Inf. 1, 345\u2013359 (1972). https:\/\/doi.org\/10.1007\/BF00289514","journal-title":"Acta Inf."},{"issue":"6","key":"28_CR18","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520\u2013540 (1987). https:\/\/doi.org\/10.1145\/214762.214771","journal-title":"Commun. ACM"},{"issue":"5","key":"28_CR19","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theory 24(5), 530\u2013536 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055934","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2021: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-67731-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T18:13:09Z","timestamp":1724350389000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-67731-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030677305","9783030677312"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-67731-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bolzano-Bozen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"47","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem2021.inf.unibz.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}