{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:57:58Z","timestamp":1740099478265,"version":"3.37.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030248857"},{"type":"electronic","value":"9783030248864"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-24886-4_19","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:02:56Z","timestamp":1563908576000},"page":"251-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Separating Many Words by Counting Occurrences of Factors"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6636-2317","authenticated-orcid":false,"given":"Aleksi","family":"Saarela","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-001-0097-4","volume":"32","author":"A Ambainis","year":"2002","unstructured":"Ambainis, A., Bloch, S.A., Schweizer, D.L.: Delayed binary search, or playing twenty questions with a procrastinator. Algorithmica 32(4), 641\u2013650 (2002). \n                      https:\/\/doi.org\/10.1007\/s00453-001-0097-4","journal-title":"Algorithmica"},{"issue":"1\u20134","key":"19_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.3233\/FI-2017-1553","volume":"154","author":"J Cassaigne","year":"2017","unstructured":"Cassaigne, J., Karhum\u00e4ki, J., Puzynina, S., Whiteland, M.A.: \n                      \n                        \n                      \n                      $$k$$\n                    -abelian equivalence and rationality. Fund. Inform. 154(1\u20134), 65\u201394 (2017). \n                      https:\/\/doi.org\/10.3233\/FI-2017-1553","journal-title":"Fund. Inform."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.ejc.2017.05.006","volume":"65","author":"J Cassaigne","year":"2017","unstructured":"Cassaigne, J., Karhum\u00e4ki, J., Saarela, A.: On growth and fluctuation of \n                      \n                        \n                      \n                      $$k$$\n                    -abelian complexity. Eur. J. Combin. 65, 92\u2013105 (2017). \n                      https:\/\/doi.org\/10.1016\/j.ejc.2017.05.006","journal-title":"Eur. J. Combin."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.jcta.2017.11.010","volume":"155","author":"J Chen","year":"2018","unstructured":"Chen, J., L\u00fc, X., Wu, W.: On the \n                      \n                        \n                      \n                      $$k$$\n                    -abelian complexity of the cantor sequence. J. Combin. Theory Ser. A 155, 287\u2013303 (2018). \n                      https:\/\/doi.org\/10.1016\/j.jcta.2017.11.010","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"19_CR5","first-page":"101","volume":"4","author":"J Currie","year":"1999","unstructured":"Currie, J., Petersen, H., Robson, J.M., Shallit, J.: Separating words with small grammars. J. Autom. Lang. Comb. 4(2), 101\u2013110 (1999)","journal-title":"J. Autom. Lang. Comb."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-642-22600-7_12","volume-title":"Descriptional Complexity of Formal Systems","author":"ED Demaine","year":"2011","unstructured":"Demaine, E.D., Eisenstat, S., Shallit, J., Wilson, D.A.: Remarks on separating words. In: Holzer, M., Kutrib, M., Pighizzini, G. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 147\u2013157. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22600-7_12"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.2307\/2036087","volume":"17","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded regular sets. Proc. Amer. Math. Soc. 17, 1043\u20131049 (1966). \n                      https:\/\/doi.org\/10.2307\/2036087","journal-title":"Proc. Amer. Math. Soc."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/3-540-16761-7_61","volume-title":"Automata, Languages and Programming","author":"P Goral\u010d\u00edk","year":"1986","unstructured":"Goral\u010d\u00edk, P., Koubek, V.: On discerning words by automata. In: Kott, L. (ed.) ICALP 1986. LNCS, vol. 226, pp. 116\u2013122. Springer, Heidelberg (1986). \n                      https:\/\/doi.org\/10.1007\/3-540-16761-7_61"},{"issue":"8","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1142\/S0218196711006650","volume":"21","author":"V Holub","year":"2011","unstructured":"Holub, V., Kortelainen, J.: On partitions separating words. Int. J. Algebra Comput. 21(8), 1305\u20131316 (2011). \n                      https:\/\/doi.org\/10.1142\/S0218196711006650","journal-title":"Int. J. Algebra Comput."},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0019-9958(80)90493-3","volume":"47","author":"J Karhum\u00e4ki","year":"1980","unstructured":"Karhum\u00e4ki, J.: Generalized Parikh mappings and homomorphisms. Inf. Control 47(3), 155\u2013165 (1980). \n                      https:\/\/doi.org\/10.1016\/S0019-9958(80)90493-3","journal-title":"Inf. Control"},{"issue":"8","key":"19_CR11","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.jcta.2013.08.008","volume":"120","author":"J Karhum\u00e4ki","year":"2013","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: On a generalization of Abelian equivalence and complexity of infinite words. J. Combin. Theory Ser. A 120(8), 2189\u20132206 (2013). \n                      https:\/\/doi.org\/10.1016\/j.jcta.2013.08.008","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.14232\/actacyb.23.1.2017.11","volume":"23","author":"J Karhum\u00e4ki","year":"2017","unstructured":"Karhum\u00e4ki, J., Saarela, A., Zamboni, L.Q.: Variations of the Morse-Hedlund theorem for \n                      \n                        \n                      \n                      $$k$$\n                    -abelian equivalence. Acta Cybernet. 23(1), 175\u2013189 (2017). \n                      https:\/\/doi.org\/10.14232\/actacyb.23.1.2017.11","journal-title":"Acta Cybernet."},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Ma\u0148uch, J.: Characterization of a word by its subwords. In: Proceedings of the 4th DLT, pp. 210\u2013219. World Scientific Publication (2000). \n                      https:\/\/doi.org\/10.1142\/9789812792464_0018","DOI":"10.1142\/9789812792464_0018"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"815","DOI":"10.2307\/2371264","volume":"60","author":"M Morse","year":"1938","unstructured":"Morse, M., Hedlund, G.A.: Symbolic dynamics. Amer. J. Math. 60(4), 815\u2013866 (1938). \n                      https:\/\/doi.org\/10.2307\/2371264","journal-title":"Amer. J. Math."},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0097-3165(87)90065-3","volume":"44","author":"A Pelc","year":"1987","unstructured":"Pelc, A.: Solution of Ulam\u2019s problem on searching with a lie. J. Combin. Theory Ser. A 44(1), 129\u2013140 (1987). \n                      https:\/\/doi.org\/10.1016\/0097-3165(87)90065-3","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.2168\/LMCS-12(1:5)2016","volume":"12","author":"T Place","year":"2016","unstructured":"Place, T., Zeitoun, M.: Separating regular languages with first-order logic. Log. Methods Comput. Sci. 12(1), 31 (2016). \n                      https:\/\/doi.org\/10.2168\/LMCS-12(1:5)2016\n                      \n                    . Paper No. 5","journal-title":"Log. Methods Comput. Sci."},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1112\/jlms\/jdq063","volume":"83","author":"G Richomme","year":"2011","unstructured":"Richomme, G., Saari, K., Zamboni, L.Q.: Abelian complexity of minimal subshifts. J. Lond. Math. Soc. 83(1), 79\u201395 (2011). \n                      https:\/\/doi.org\/10.1112\/jlms\/jdq063","journal-title":"J. Lond. Math. Soc."},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0020-0190(89)90215-9","volume":"30","author":"JM Robson","year":"1989","unstructured":"Robson, J.M.: Separating strings with small automata. Inform. Process. Lett. 30(4), 209\u2013214 (1989). \n                      https:\/\/doi.org\/10.1016\/0020-0190(89)90215-9","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1134\/S1990478914020161","volume":"21","author":"MN Vyaly\u012d","year":"2014","unstructured":"Vyaly\u012d, M.N., Gimadeev, R.A.: On separating words by the occurrences of subwords. Diskretn. Anal. Issled. Oper. 21(1), 3\u201314 (2014). \n                      https:\/\/doi.org\/10.1134\/S1990478914020161","journal-title":"Diskretn. Anal. Issled. Oper."}],"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-030-24886-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T19:04:56Z","timestamp":1563908696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24886-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030248857","9783030248864"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24886-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dlt2019.mimuw.edu.pl\/","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":"30","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":"20","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":"0","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":"67% - 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","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":"2","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)"}}]}}