{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:17:54Z","timestamp":1725466674451},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316524"},{"type":"electronic","value":"9783642316531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31653-1_41","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T09:51:39Z","timestamp":1342259499000},"page":"459-464","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Languages by Normalization and Termination in String Rewriting"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","unstructured":"Avanzini, M., Moser, G.: Closing the gap between runtime complexity and polytime computability. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010). Leibniz International Proceedings in Informatics, vol.\u00a06, pp. 33\u201348 (2010)"},{"issue":"1-2","key":"41_CR2","first-page":"121","volume":"56","author":"M.-P. B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.-P., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundamenta Informaticae\u00a056(1-2), 121\u2013135 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/aama.2000.0682","volume":"25","author":"M.-P. B\u00e9al","year":"2000","unstructured":"B\u00e9al, M.-P., Mignosi, F., Restivo, A., Sciortino, M.: Forbidden words in symbolic dynamics. Advances in Applied Mathematics\u00a025, 163\u2013193 (2000)","journal-title":"Advances in Applied Mathematics"},{"issue":"3","key":"41_CR4","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/S0304-3975(02)00070-1","volume":"290","author":"M. Beaudry","year":"2003","unstructured":"Beaudry, M., Holzer, M., Niemann, G., Otto, F.: McNaughton families of languages. Theoretical Computer Science\u00a0290(3), 1581\u20131628 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"41_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0747-7171(87)80021-4","volume":"3","author":"R. Book","year":"1987","unstructured":"Book, R.: Thue systems as rewriting systems. Journal of Symbolic Computation\u00a03(1-2), 39\u201368 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Book, R., Otto, F.: String Rewriting. Texts and Monographs in Computer Science. Springer (1993)","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Chomsky, N.: Syntactic Structures. Mouton & Co. (1957)","DOI":"10.1515\/9783112316009"},{"issue":"2&3","key":"41_CR8","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(89)90005-4","volume":"67","author":"C. Choppy","year":"1989","unstructured":"Choppy, C., Kaplan, S., Soria, M.: Complexity analysis of term-rewriting systems. Theoretical Computer Science 67(2&3), 261\u2013282 (1989)","journal-title":"Theoretical Computer Science"},{"key":"41_CR9","unstructured":"Davis, M.: Computability and Unsolvability. Dover Publications Inc. (1982) (Originally published in 1958 by McGraw-Hill Book Company)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Computability and Complexity from a Programming Perspective. The MIT Press (1997)","DOI":"10.7551\/mitpress\/2003.001.0001"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0890-5401(03)00187-1","volume":"187","author":"J.H. Lutz","year":"2003","unstructured":"Lutz, J.H.: The dimensions of individual strings and sequences. Information and Computation\u00a0187(1), 49\u201379 (2003)","journal-title":"Information and Computation"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1145\/42282.42284","volume":"35","author":"R. McNaughton","year":"1988","unstructured":"McNaughton, R., Narendran, P., Otto, F.: Church-Rosser Thue systems and formal languages. Journal of the Association for Computing Machinery\u00a035(2), 324\u2013344 (1988)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"41_CR13","unstructured":"Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall Series in Automatic Computation. Prentice-Hall (1967)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Nivat, M.: On some families of languages related to the Dyck language. In: Proceedings of the 2nd Annual ACM Symposium on Theory of Computing (STOC 1970), pp. 221\u2013225 (1970)","DOI":"10.1145\/800161.805168"},{"key":"41_CR15","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Thomson Course Technology (2006)"},{"key":"41_CR16","unstructured":"Terese (ed.): Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol.\u00a055. Cambridge University Press (2003)"}],"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-31653-1_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:41:41Z","timestamp":1620128501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31653-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316524","9783642316531"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31653-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}