{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:44Z","timestamp":1725455924748},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023490","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:06:33Z","timestamp":1132365993000},"page":"571-582","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pattern matching in trace monoids"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Messner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"47_CR1","unstructured":"Aho, A. V., Hopcroft, J. E., and Ullman, J. D. The Design and Analysis of Computer Algorithms. Addison Wesley, 1974."},{"key":"47_CR2","volume-title":"Lattice Theory","author":"G. Birkhof","year":"1940","unstructured":"Birkhof, G. Lattice Theory. Amer. Math. Soc., Providence, RI, 1940."},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Cartier, P., and Foata, D. Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements. Lect. Notes in Math. 85. Springer, 1969.","DOI":"10.1007\/BFb0079468"},{"key":"47_CR4","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0304-3975(85)90013-1","volume":"35","author":"R. Cori","year":"1985","unstructured":"Cori, R., and M\u00e9tivier, Y. Recognizable subsets of some partially abelian monoids. Theoretical Computer Science, 35:179\u2013189, 1985.","journal-title":"Theoretical Computer Science"},{"key":"47_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R. Cori","year":"1993","unstructured":"Cori, R., M\u00e9tivier, Y., and Zielonka, W. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159\u2013202, 1993.","journal-title":"Information and Computation"},{"key":"47_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R. Cori","year":"1985","unstructured":"Cori, R., and Perrin, D. Automates et commutations partielles. RAIRO Informatique Th\u00e9orique et Applications, 19:21\u201332, 1985.","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"Diekert, V. Combinatorics on Traces. LNCS 454. Springer, 1990.","DOI":"10.1007\/3-540-53031-2"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Diekert, V., and M\u00e9tivier, Y. Partial commutation and traces. In Rozenberg, G., and Salomaa, A., Handbook on Formal Languages, volume III. Springer, 1996.","DOI":"10.1007\/978-3-642-59126-6_8"},{"volume-title":"The Book of Traces","year":"1995","key":"47_CR9","unstructured":"Diekert, V., and Rozenberg G., editors. The Book of Traces. World Scientific, Singapore, 1995."},{"key":"47_CR10","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","volume":"46","author":"C. Duboc","year":"1986","unstructured":"Duboc, C. On some equations in free partially commutative monoids. Theoretical Computer Science, 46:159\u2013174, 1986.","journal-title":"Theoretical Computer Science"},{"key":"47_CR11","volume-title":"Automata, Languages, and Machines, volume A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S. Automata, Languages, and Machines, volume A. Academic Press, New York and London, 1974."},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(93)90247-Q","volume":"120","author":"P. Gastin","year":"1993","unstructured":"Gastin, P., and Rozoy, B. The poset of infinitary traces. Theoretical Computer Science, 120:101\u2013121, 1993.","journal-title":"Theoretical Computer Science"},{"key":"47_CR13","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0890-5401(92)90060-S","volume":"101","author":"K. Hashiguchi","year":"1992","unstructured":"Hashiguchi, K., and Yamada, K. String matching problems over free partially commutative monoids. Information and Computation, 101:131\u2013149, 1992.","journal-title":"Information and Computation"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D. E. Knuth","year":"1977","unstructured":"Knuth, D. E., Morris, J. H., and Pratt, V. R. Fast pattern matching in strings. SIAM Journal on Computing, 6:323\u2013350, 1977.","journal-title":"SIAM Journal on Computing"},{"key":"47_CR15","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/0890-5401(90)90010-F","volume":"89","author":"H.-N. Liu","year":"1990","unstructured":"Liu, H.-N., Wrathall, C., and Zeger, K. Efficient solution of some problems in free partially commutative monoids. Information and Computation, 89:180\u2013198, 1990.","journal-title":"Information and Computation"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"47_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0022-0000(91)90010-3","volume":"42","author":"F. Otto","year":"1991","unstructured":"Otto, F., and Wrathall, C. Overlaps in free partially commutative monoids. Journal of Computer and System Sciences, 42:186\u2013198, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"47_CR18","volume-title":"Einf\u00fchrung in die Komplexit\u00e4tstheorie","author":"K. R. Reischuk","year":"1990","unstructured":"Reischuk, K. R. Einf\u00fchrung in die Komplexit\u00e4tstheorie. Teubner, Stuttgart, 1990."}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023490","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:34:53Z","timestamp":1578526493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023490"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0023490","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}