{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:56:58Z","timestamp":1725530218165},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009815"},{"type":"electronic","value":"9783642009822"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00982-2_43","type":"book-chapter","created":{"date-parts":[[2009,3,30]],"date-time":"2009-03-30T19:51:54Z","timestamp":1238442714000},"page":"505-517","source":"Crossref","is-referenced-by-count":3,"title":["Automata on Gauss Words"],"prefix":"10.1007","author":[{"given":"Alexei","family":"Lisitsa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Potapov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafiq","family":"Saleh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","unstructured":"Kari, J., Niemi, V.: Morphic Images of Gauss Codes. In: Developments in Language Theory, pp. 144\u2013156 (1993)"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: Temperley-Lieb Algebra: From Knot Theory to Logic and Computation via Quantum Mechanics. Mathematics of Quantum Computation and Quantum Technology (2007)","DOI":"10.1201\/9781584889007.ch15"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11549345_2","volume-title":"Mathematical Foundations of Computer Science 2005","author":"R. Freivalds","year":"2005","unstructured":"Freivalds, R.: Knot Theory, Jones Polynomial and Quantum Computing. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 15\u201325. Springer, Heidelberg (2005)"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Lomonaco Jr., S., Kauffman, L.: Topological Quantum Computing and the Jones Polynomial. Arxiv Preprint Quant-ph\/ 0605004 (2006)","DOI":"10.1117\/12.665361"},{"issue":"2","key":"43_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/301970.301971","volume":"46","author":"J. Hass","year":"1999","unstructured":"Hass, J., Lagarias, J., Pippenger, N.: The computational complexity of knot and link problems. Journal of the ACM (JACM)\u00a046(2), 185\u2013211 (1999)","journal-title":"Journal of the ACM (JACM)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, pp. 683\u2013688 (1990)","DOI":"10.1109\/FSCS.1990.89590"},{"issue":"3","key":"43_CR7","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1145\/1013560.1013562","volume":"5","author":"F. Neven","year":"2004","unstructured":"Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic (TOCL)\u00a05(3), 403\u2013435 (2004)","journal-title":"ACM Transactions on Computational Logic (TOCL)"},{"key":"43_CR8","unstructured":"Kurlin, V.: Gauss phrases realizable by classical links. Arxiv Preprint Math. GT\/ 0610929 (2006)"},{"key":"43_CR9","unstructured":"David, C.: Mots et donn\u00e9es infinies. Master\u2019s thesis, LIAFA (2004)"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Demri, S., Lazic, R.: LTL with the freeze quantifier and register automata. In: LICS, vol.\u00a06, pp. 17\u201326 (2006)","DOI":"10.1109\/LICS.2006.31"},{"issue":"1","key":"43_CR11","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. Journal of Computer and System Sciences\u00a066(1), 66\u201397 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR12","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. Bjorklund","year":"2007","unstructured":"Bjorklund, 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":"43_CR13","unstructured":"Kauffman, L.: Virtual knot theory. Arxiv Preprint Math. GT\/ 9811028 (1998)"},{"issue":"4","key":"43_CR14","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S0218216593000209","volume":"2","author":"G. Cairns","year":"1993","unstructured":"Cairns, G., Elton, D.: The planarity problem for signed Gauss words. Journal of Knot Theory and its Ramifications\u00a02(4), 359\u2013367 (1993)","journal-title":"Journal of Knot Theory and its Ramifications"},{"key":"43_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S0218216596000102","volume":"5","author":"G. Cairns","year":"1996","unstructured":"Cairns, G., Elton, D.: The Planarity Problem II. Journal of Knot Theory and its Ramifications\u00a05, 137\u2013144 (1996)","journal-title":"Journal of Knot Theory and its Ramifications"},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1090\/S0002-9939-1991-1043406-7","volume":"111","author":"J. Carter","year":"1991","unstructured":"Carter, J.: Classifying immersed curves. Proc. Amer. Math. Soc.\u00a0111, 281\u2013287 (1991)","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00982-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T05:26:37Z","timestamp":1558243597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00982-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009815","9783642009822"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00982-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}