{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:09:22Z","timestamp":1725894562201},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335112"},{"type":"electronic","value":"9783642335129"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33512-9_11","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T03:18:53Z","timestamp":1347074333000},"page":"121-136","source":"Crossref","is-referenced-by-count":1,"title":["On the Length of Knot Transformations via Reidemeister Moves I and II"],"prefix":"10.1007","author":[{"given":"Rafiq","family":"Saleh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge Univ. Pr. (1999)","DOI":"10.1017\/CBO9781139172752"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-74240-1_9","volume-title":"Fundamentals of Computation Theory","author":"H. Bj\u00f6rklund","year":"2007","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On Notions of Regularity for Data Languages. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 88\u201399. Springer, Heidelberg (2007)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"659","DOI":"10.2140\/agt.2006.6.659","volume":"6","author":"A. Coward","year":"2006","unstructured":"Coward, A.: Ordering the Reidemeister moves of a classical knot. Algebraic & Geometric Topology\u00a06, 659\u2013671 (2006)","journal-title":"Algebraic & Geometric Topology"},{"key":"11_CR4","first-page":"1104","volume":"arXiv","author":"A. Coward","year":"2011","unstructured":"Coward, A., Lackenby, M.: An upper bound on reidemeister moves. Arxiv preprint arXiv:1104.1882 (2011)","journal-title":"Arxiv preprint"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Haken, W.: Theorie der Normalfachen, ein Isotopiekriterium fur den Kreisknoten. Journal of Acta Mathematica 105 (1961)","DOI":"10.1007\/BF02559591"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1090\/S0894-0347-01-00358-7","volume":"14","author":"J. Hass","year":"2001","unstructured":"Hass, J., Lagarias, J.C.: The number of Reidemeister moves needed for unknotting. Journal of the American Mathematical Society\u00a014(2), 399\u2013428 (2001)","journal-title":"Journal of the American Mathematical Society"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00454-009-9156-4","volume":"44","author":"J. Hass","year":"2010","unstructured":"Hass, J., Nowik, T.: Unknot diagrams requiring a quadratic number of Reidemeister moves to untangle. Discrete and Computational Geometry\u00a044(1), 91\u201395 (2010)","journal-title":"Discrete and Computational Geometry"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/S0218216506004488","volume":"15","author":"C. Hayashi","year":"2006","unstructured":"Hayashi, C.: A lower bound for the number of Reidemeister moves for unknotting. Journal of Knot Theory and its Ramifications\u00a015(3), 313 (2006)","journal-title":"Journal of Knot Theory and its Ramifications"},{"key":"11_CR9","unstructured":"Kauffman, L.H.: Virtual knot theory. Arxiv Preprint Math. GT\/, 9811028 (1998)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-21254-3_29","volume-title":"Language and Automata Theory and Applications","author":"A. Lisitsa","year":"2011","unstructured":"Lisitsa, A., Potapov, I., Saleh, R.: Planarity of Knots, Register Automata and LogSpace Computability. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 366\u2013377. Springer, Heidelberg (2011)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/3-540-44683-4_49","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F. Neven","year":"2001","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Towards Regular Languages over Infinite Alphabets. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol.\u00a02136, pp. 560\u2013572. Springer, Heidelberg (2001)"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of equivalence. The Annals of Mathematics\u00a043(2), 223\u2013243 (1942)","journal-title":"The Annals of Mathematics"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Reidemeister, K.: Elementare Begr\u00fcndung der Knotentheorie. In: Abhandlungen aus dem Mathematischen Seminar der Universit\u00e4t Hamburg, vol.\u00a05, pp. 24\u201332. Springer (1927)","DOI":"10.1007\/BF02952507"},{"key":"11_CR14","unstructured":"Suh, C.H.O.: A short proof of the hass\u2013lagarias theorem (2008)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33512-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:18:35Z","timestamp":1558300715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33512-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335112","9783642335129"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33512-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}