{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:59:17Z","timestamp":1648817957371},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":3516,"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":[[2003,12]]},"DOI":"10.1016\/s0304-3975(03)00313-x","type":"journal-article","created":{"date-parts":[[2003,6,3]],"date-time":"2003-06-03T00:27:11Z","timestamp":1054600031000},"page":"381-412","source":"Crossref","is-referenced-by-count":1,"title":["Two techniques in the area of the star problem in trace monoids"],"prefix":"10.1016","volume":"309","author":[{"given":"Daniel","family":"Kirsten","sequence":"first","affiliation":[]},{"given":"Jerzy","family":"Marcinkowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00313-X_BIB1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1051\/ita\/1986200201031","article-title":"Trace languages defined by recognizable string languages","volume":"20","author":"Aalbersberg","year":"1986","journal-title":"RAIRO\u2014Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB2","series-title":"Transductions and Context-Free Languages","author":"Berstel","year":"1979"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB3","series-title":"Proc. Coll. on Algebra, Combinatorics and Logic in Computer Science","first-page":"113","article-title":"Unambiguous regular trace languages","volume":"Vol. 42","author":"Bertoni","year":"1985"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB4","article-title":"Probl\u00e8mes combinatoires de commutation et r\u00e9arrangements","volume":"Vol. 85","author":"Cartier","year":"1969"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","article-title":"Semi-commutations","volume":"73","author":"Clerbout","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB6","doi-asserted-by":"crossref","unstructured":"V. Diekert, Y. M\u00e9tivier, Partial commutation and traces, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Beyond Words, Springer, Berlin, 1997, pp. 457\u2013534.","DOI":"10.1007\/978-3-642-59126-6_8"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB7","doi-asserted-by":"crossref","unstructured":"V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995.","DOI":"10.1142\/9789814261456"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(86)90094-0","article-title":"Mixed product and asynchronous automata","volume":"48","author":"Duboc","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB9","unstructured":"S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press, New York, 1974."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB10","first-page":"197","article-title":"Matrices de Hankel","volume":"53","author":"Fliess","year":"1974","journal-title":"J. Math. Pures Appl."},{"issue":"2","key":"10.1016\/S0304-3975(03)00313-X_BIB11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0020-0190(92)90187-Z","article-title":"Decidability of the star problem in A*\u00d7{b}*","volume":"44","author":"Gastin","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB12","doi-asserted-by":"crossref","unstructured":"D. Giammarresi, A. Restivo, Recognizable picture languages, in: M. Nivat, A. Saoudi, P.S.P. Wangs (Eds.), Special Issue on Parallel image processing, Internat. J. Pattern Recognition Artif. Intell. 6 (2\u20133) (1992) 241\u2013256.","DOI":"10.1142\/9789812797872_0003"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB13","doi-asserted-by":"crossref","unstructured":"D. Giammarresi, A. Restivo, Two-dimensional languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Beyond Words, Springer, Berlin, 1997, pp. 215\u2013267.","DOI":"10.1007\/978-3-642-59126-6_4"},{"issue":"5","key":"10.1016\/S0304-3975(03)00313-X_BIB14","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1090\/S0002-9939-1966-0201310-3","article-title":"Bounded regular sets","volume":"17","author":"Ginsburg","year":"1966","journal-title":"Proc. AMS"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","article-title":"Semigroups, Presburger formulas, and languages","volume":"16","author":"Ginsburg","year":"1966","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB16","first-page":"233","article-title":"Limitedness theorem on finite automata with distance functions","volume":"24","author":"Hashiguchi","year":"1982","journal-title":"Theory Comput. Systems"},{"issue":"1","key":"10.1016\/S0304-3975(03)00313-X_BIB17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(90)90044-I","article-title":"Improved limitedness theorems on finite automata with distance functions","volume":"72","author":"Hashiguchi","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB18","unstructured":"D. Kirsten, On decision problems of recognizable trace languages, Ph.D. Thesis, Department of Computer Science, Dresden University of Technology, 1999."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB19","series-title":"STACS\u201999 Proc","first-page":"227","article-title":"Some undecidability results related to the star problem in trace monoids","volume":"Vol. 1563","author":"Kirsten","year":"1999"},{"issue":"1","key":"10.1016\/S0304-3975(03)00313-X_BIB20","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1006\/inco.2002.3152","article-title":"The star problem and the finite power property in trace monoids","volume":"176","author":"Kirsten","year":"2002","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB21","series-title":"ICALP\u201999 Proc","first-page":"483","article-title":"Two techniques in the area of the star problem","volume":"Vol. 1644","author":"Kirsten","year":"1999"},{"issue":"3","key":"10.1016\/S0304-3975(03)00313-X_BIB22","first-page":"193","article-title":"Decidability equivalence between the star problem and the finite power problem in trace monoids","volume":"34","author":"Kirsten","year":"2001","journal-title":"ACM Trans. Comput. Systems"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB23","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Report PB 78, Aarhus University, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB24","doi-asserted-by":"crossref","first-page":"1343","DOI":"10.2140\/pjm.1964.14.1343","article-title":"Kleene quotient theorem","volume":"14","author":"McKnight","year":"1964","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1051\/ita\/1986200201211","article-title":"Une condition suffisante de reconnaissabilit\u00e9 dans un mono\u0131\u0308de partiellement commutatif","volume":"20","author":"M\u00e9tivier","year":"1986","journal-title":"RAIRO\u2014Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB26","series-title":"STACS\u201994 Proc","first-page":"341","article-title":"On the star operation and the finite power property in free partially commutative monoids","volume":"Vol. 775","author":"M\u00e9tivier","year":"1994"},{"issue":"2","key":"10.1016\/S0304-3975(03)00313-X_BIB27","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1006\/inco.1995.1088","article-title":"New results on the star problem in trace monoids","volume":"119","author":"M\u00e9tivier","year":"1995","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB28","series-title":"The Book of Traces","first-page":"167","article-title":"Recognizable trace languages","author":"Ochma\u0144ski","year":"1995"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB29","unstructured":"E. Ochma\u0144ski, Regular trace languages, Ph.D. Thesis, Warszawa, 1984 (in Polish)."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB30","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB31","series-title":"MFCS\u201994 Proc","first-page":"557","article-title":"Some trace monoids where both the star problem and the finite power property problem are decidable","volume":"Vol. 841","author":"Richomme","year":"1994"},{"issue":"12","key":"10.1016\/S0304-3975(03)00313-X_BIB32","first-page":"579","article-title":"Reversible machines and post's correspondence problem for biprefix morphisms","volume":"21","author":"Ruohonen","year":"1985","journal-title":"J. Inform. Process. Cybernet. (EIK)"},{"key":"10.1016\/S0304-3975(03)00313-X_BIB33","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(87)90080-6","article-title":"On regular trace languages","volume":"52","author":"Sakarovitch","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00313-X_BIB34","series-title":"LATIN\u201992 Proc","first-page":"460","article-title":"The \u201clast\u201d decision problem for rational trace languages","volume":"Vol. 583","author":"Sakarovitch","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300313X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300313X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T19:47:44Z","timestamp":1584733664000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750300313X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S030439750300313X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00313-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}