{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T20:28:15Z","timestamp":1672345695967},"reference-count":24,"publisher":"Elsevier BV","issue":"2","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)90314-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"249-268","source":"Crossref","is-referenced-by-count":6,"title":["Probabilistic estimation of the number of prefixes of a trace"],"prefix":"10.1016","volume":"92","author":[{"given":"Massimiliano","family":"Goldwurm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90314-6_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02088289","article-title":"Characterizations of the decidability of some problems for regular trace languages","volume":"22","author":"Aalbersberg","year":"1989","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(92)90314-6_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","article-title":"Theory of traces","volume":"60","author":"Aalbersberg","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90314-6_BIB3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1051\/ita\/1986200201031","article-title":"Trace languages defined by regular string languages","volume":"20","author":"Aalbersberg","year":"1986","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(92)90314-6_BIB4","series-title":"Proc. 5th AAECC Conference","first-page":"35","article-title":"On the number of prefixes of a random trace and membership problem for context-free trace languages","volume":"Vol. 356","author":"Bertoni","year":"1989"},{"key":"10.1016\/0304-3975(92)90314-6_BIB5","series-title":"Proc. 4th AAECC Conference","first-page":"202","article-title":"Analysis of a class of algorithms for problems on trace languages","volume":"Vol. 307","author":"Bertoni","year":"1988"},{"key":"10.1016\/0304-3975(92)90314-6_BIB6","first-page":"32","article-title":"Context-free trace languages","author":"Bertoni","year":"1982","journal-title":"Proc. 7th CAAP"},{"key":"10.1016\/0304-3975(92)90314-6_BIB7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0890-5401(89)90051-5","article-title":"Membership problems for regular and context-free trace languages","volume":"82","author":"Bertoni","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(92)90314-6_BIB8","series-title":"Proc. 5th STACS","first-page":"334","article-title":"On the existence of the minimum asynchronous automaton and on decision problems for unambiguous regular trace languages","volume":"Vol. 294","author":"Bruschi","year":"1988"},{"key":"10.1016\/0304-3975(92)90314-6_BIB9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1051\/ita\/1985190100211","article-title":"Automates et communications partielles","volume":"19","author":"Cori","year":"1985","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/0304-3975(92)90314-6_BIB10","series-title":"Doctoral Thesis","article-title":"Commutations dans les monoides libres: un cadre th\u00e9orique pour l'\u00e9tude du parall\u00e9lism","author":"Duboc","year":"1986"},{"key":"10.1016\/0304-3975(92)90314-6_BIB11","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(86)90101-5","article-title":"On the decidability of some problems about rational subsets of free partially commutative monoids","volume":"48","author":"Gibbons","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(92)90314-6_BIB12","series-title":"Doctoral Thesis","article-title":"Formal series methods in algorithm analysis for problems on languages","author":"Goldwurm","year":"1988"},{"key":"10.1016\/0304-3975(92)90314-6_BIB13","series-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1984"},{"key":"10.1016\/0304-3975(92)90314-6_BIB14","volume":"vol. 2","author":"Henrici","year":"1977"},{"key":"10.1016\/0304-3975(92)90314-6_BIB15","series-title":"Probabilistic analysis of algorithms","author":"Hofri","year":"1987"},{"key":"10.1016\/0304-3975(92)90314-6_BIB16","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190060402","article-title":"A review of random graphs","volume":"6","author":"Karonski","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0304-3975(92)90314-6_BIB17","series-title":"Stochastic convergence","author":"Lukacs","year":"1975"},{"key":"10.1016\/0304-3975(92)90314-6_BIB18","series-title":"Concurrent program schemes and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(92)90314-6_BIB19","first-page":"56","article-title":"Regular behaviour of concurrent systems","volume":"27","author":"Ochmanski","year":"1985","journal-title":"Bull. EATCS"},{"issue":"1","key":"10.1016\/0304-3975(92)90314-6_BIB20","first-page":"117","article-title":"Some properties of trace languages","volume":"VII","author":"Rytter","year":"1984","journal-title":"Fund. Inform"},{"key":"10.1016\/0304-3975(92)90314-6_BIB21","series-title":"Automata-Theoretic Aspects of Formal Power Series","author":"Salomaa","year":"1978"},{"key":"10.1016\/0304-3975(92)90314-6_BIB22","series-title":"Automata Theoretic Letters 1979\u29f82","article-title":"Trace languages and closure operations","author":"Szij\u00e0rt\u00f2","year":"1979"},{"key":"10.1016\/0304-3975(92)90314-6_BIB23","series-title":"Proc. Colloque de Combinatoire Enum\u00e9rative UQAM.","article-title":"Heaps of pieces I: basic definitions and combinatorial lemmas","volume":"Vol. 1234","author":"Viennot","year":"1985"},{"key":"10.1016\/0304-3975(92)90314-6_BIB24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","article-title":"Notes on asynchronous automata","volume":"21","author":"Zielonka","year":"1987","journal-title":"RAIRO Inform. Th\u00e9or. Appl."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397592903146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:56:47Z","timestamp":1555113407000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397592903146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0304397592903146"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90314-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}