{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:39:00Z","timestamp":1648859940537},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7868,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1016\/0304-3975(92)90136-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"77-86","source":"Crossref","is-referenced-by-count":1,"title":["Two recognizable string-matching problems over free partially commutative monoids"],"prefix":"10.1016","volume":"92","author":[{"given":"Kosaburo","family":"Hashiguchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuya","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90136-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(92)90136-4_BIB2","first-page":"262","article-title":"A fast string searching algorithm","volume":"20","author":"Boyer","year":"1977","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(92)90136-4_BIB3","article-title":"Problems combinatoires de commutations et de rearrangement","volume":"Vol. 85","author":"Catier","year":"1969"},{"key":"10.1016\/0304-3975(92)90136-4_BIB4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","article-title":"Automates et commutations partielles","volume":"19","author":"Cori","year":"1985","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"10.1016\/0304-3975(92)90136-4_BIB5","series-title":"Combinatorial Algorithms on Words","first-page":"31","article-title":"Optimal factor transducers","author":"Crochmore","year":"1985"},{"key":"10.1016\/0304-3975(92)90136-4_BIB6","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(86)90028-9","article-title":"On some equations in free partially commutative monoids","volume":"46","author":"Duboc","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90136-4_BIB7","unstructured":"K. Hashiguchi, Recognizable closures and submonoids of free partially commutative monoids, to appear in Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90136-4_BIB8","doi-asserted-by":"crossref","unstructured":"K. Hashiguchi and K. Yamada, String matching problems over free partially commutative monoids, Inform. and Comput., to appear.","DOI":"10.1016\/0890-5401(92)90060-S"},{"key":"10.1016\/0304-3975(92)90136-4_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","article-title":"Fast pattern matching in strings","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90136-4_BIB10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0304-3975(88)90027-8","article-title":"On recognizable subsets of free partially commutative monoids","volume":"58","author":"Metivier","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90136-4_BIB11","first-page":"56","article-title":"Regular behaviour of concurrent systems","author":"Ochamanski","year":"1985","journal-title":"EATCS Bull."},{"key":"10.1016\/0304-3975(92)90136-4_BIB12","series-title":"Combinatorial Algorithms on Words","first-page":"329","article-title":"Words over a partially commutative alphabet","author":"Perrin","year":"1985"},{"key":"10.1016\/0304-3975(92)90136-4_BIB13","first-page":"637","article-title":"Partial commutations","volume":"Vol. 372","author":"Perrin","year":"1989"},{"key":"10.1016\/0304-3975(92)90136-4_BIB14","series-title":"Proc. 14th Ann. Symp. on Switching and Automata Theory","first-page":"1","article-title":"Linear pattern-matching algorithms","author":"Weiner","year":"1973"},{"key":"10.1016\/0304-3975(92)90136-4_BIB15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","article-title":"Notes on finite asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"RAIRO Inform. Theor. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901364?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592901364?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:57:07Z","timestamp":1555077427000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592901364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592901364"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90136-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}