{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:09Z","timestamp":1725730569875},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_39","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"445-457","source":"Crossref","is-referenced-by-count":0,"title":["Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth"],"prefix":"10.1007","author":[{"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a02, pp. 463\u2013505. Springer (1997)","DOI":"10.1007\/978-3-662-07675-0_10"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0020-0190(98)00104-5","volume":"67","author":"M. Crochemore","year":"1998","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inform. Process. Lett.\u00a067, 111\u2013117 (1998)","journal-title":"Inform. Process. Lett."},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/BF01095017","volume":"12","author":"V.E. Govorov","year":"1972","unstructured":"Govorov, V.E.: Graded algebras. Math. Notes\u00a012, 552\u2013556 (1972)","journal-title":"Math. Notes"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"447","DOI":"10.4310\/jdg\/1214428659","volume":"2","author":"J. Milnor","year":"1968","unstructured":"Milnor, J.: Growth of finitely generated solvable groups. J. Diff. Geom.\u00a02, 447\u2013450 (1968)","journal-title":"J. Diff. Geom."},{"key":"39_CR5","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.\u00a060, 815\u2013866 (1938)","journal-title":"Amer. J. Math."},{"key":"39_CR6","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-theoretic aspects of formal power series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-theoretic aspects of formal power series. Texts and Monographs in Computer Science. Springer, New York (1978)"},{"key":"39_CR7","first-page":"190","volume":"8","author":"M.P. Sch\u00fctzenberger","year":"1965","unstructured":"Sch\u00fctzenberger, M.P.: On finite monoids having only trivial subgroups. Information and Computation\u00a08, 190\u2013194 (1965)","journal-title":"Information and Computation"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-540-79709-8_30","volume-title":"Computer Science \u2013 Theory and Applications","author":"A.M. Shur","year":"2008","unstructured":"Shur, A.M.: Combinatorial complexity of regular languages. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) CSR 2008. LNCS, vol.\u00a05010, pp. 289\u2013301. Springer, Heidelberg (2008)"},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1051\/ita:2008028","volume":"43","author":"A.M. Shur","year":"2009","unstructured":"Shur, A.M.: Polynomial languages with finite antidictionaries. RAIRO Inform. Th\u00e9or. App.\u00a043, 269\u2013280 (2009)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"39_CR10","first-page":"220","volume":"74","author":"A.M. Shur","year":"2010","unstructured":"Shur, A.M.: Languages with finite antidictionaries: growth index and properties of automata. Proc. Ural State Univ.\u00a074, 220\u2013245 (2010) (in Russian)","journal-title":"Proc. Ural State Univ."},{"key":"39_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cosrev.2012.09.001","volume":"6","author":"A.M. Shur","year":"2012","unstructured":"Shur, A.M.: Growth properties of power-free languages. Computer Science Review\u00a06, 187\u2013208 (2012)","journal-title":"Computer Science Review"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:21:35Z","timestamp":1557778895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}