{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:44:51Z","timestamp":1743111891879,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642225994"},{"type":"electronic","value":"9783642226007"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22600-7_12","type":"book-chapter","created":{"date-parts":[[2011,7,19]],"date-time":"2011-07-19T20:58:15Z","timestamp":1311109095000},"page":"147-157","source":"Crossref","is-referenced-by-count":5,"title":["Remarks on Separating Words"],"prefix":"10.1007","author":[{"given":"Erik D.","family":"Demaine","sequence":"first","affiliation":[]},{"given":"Sarah","family":"Eisenstat","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]},{"given":"David A.","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci.\u00a047, 149\u2013158 (1986); Erratum 302, 497\u2013498 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR2","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. Automata, Languages, and Combinatorics\u00a04, 101\u2013110 (1999)","journal-title":"J. Automata, Languages, and Combinatorics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1016\/j.ic.2007.07.001","volume":"205","author":"V. Geffert","year":"2007","unstructured":"Geffert, V.: Magic numbers in the state hierarchy of finite automata. Inform. Comput.\u00a0205, 1652\u20131670 (2007)","journal-title":"Inform. Comput."},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-642-13182-0_14","volume-title":"Computer Science \u2013 Theory and Applications","author":"R.A. Gimadeev","year":"2010","unstructured":"Gimadeev, R.A., Vyalyi, M.N.: Identical relations in symmetric groups and separating words with reversible automata. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 144\u2013155. Springer, Heidelberg (2010)"},{"key":"12_CR5","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.\u00a0226, pp. 116\u2013122. Springer, Heidelberg (1986)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0022-0000(79)90048-5","volume":"18","author":"A. Nozaki","year":"1979","unstructured":"Nozaki, A.: Equivalence problem of non-deterministic finite automata. J. Comput. System Sci.\u00a018, 8\u201317 (1979)","journal-title":"J. Comput. System Sci."},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0020-0190(89)90215-9","volume":"30","author":"J.M. Robson","year":"1989","unstructured":"Robson, J.M.: Separating strings with small automata. Inform. Process. Lett.\u00a030, 209\u2013214 (1989)","journal-title":"Inform. Process. Lett."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1051\/ita\/1996300100811","volume":"30","author":"J.M. Robson","year":"1996","unstructured":"Robson, J.M.: Separating words with machines and groups. RAIRO Inform. Th\u00e9or. App.\u00a030, 81\u201386 (1996)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"12_CR9","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J. Shallit","year":"2009","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory. Cambridge University Press, Cambridge (2009)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1006\/jcss.1996.0046","volume":"53","author":"J. Shallit","year":"1996","unstructured":"Shallit, J., Breitbart, Y.: Automaticity I: Properties of a measure of descriptional complexity. J. Comput. System Sci.\u00a053, 10\u201325 (1996)","journal-title":"J. Comput. System Sci."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1016\/j.ipl.2009.06.005","volume":"109","author":"A.W. To","year":"2009","unstructured":"To, A.W.: Unary finite automata vs. arithmetic progressions. Inform. Process. Lett.\u00a0109, 1010\u20131014 (2009)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22600-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T22:46:37Z","timestamp":1548456397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22600-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642225994","9783642226007"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22600-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}