{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:20:51Z","timestamp":1742401251417},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540115762"},{"type":"electronic","value":"9783540393085"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":[[1982]]},"DOI":"10.1007\/bfb0012757","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:00:52Z","timestamp":1132732852000},"page":"61-71","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Equivalence and membership problems for regular trace languages"],"prefix":"10.1007","author":[{"given":"A.","family":"Bertoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Mauri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sabadini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Bertoni,A.,Brambilla,M.,Mauri,G.,Sabadini,N., An application of the theory of free partially commutative monoids: asymptotic densities of trace languages,Lect.Not.Comp.Sci.,118,Springer, 1981.","DOI":"10.1007\/3-540-10856-4_86"},{"key":"6_CR2","unstructured":"Bertoni,A.,Mauri,G.,Sabadini,N.,A hierarchy of regular trace languages and some combinatorial applications,Second World Conference on Mathematics at the Service of Men,Las Palmas,1982."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R.P. Dilworth","year":"1950","unstructured":"Dilworth,R.P.,A decomposition theorem for partially ordered sets,Ann.of Math.51,1950,pp.161\u2013166.","journal-title":"Ann.of Math."},{"key":"6_CR4","volume-title":"Computers and intractability","author":"M. Garey","year":"1979","unstructured":"Garey,M., Johnson,D.J.,Computers and intractability,Freeman and Co, San Francisco,1979."},{"key":"6_CR5","volume-title":"Formal languages and their relations to automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft,J.E.,Ullman,J.D.,Formal languages and their relations to automata, Addison Wesley,Reading Mass.,1969."},{"key":"6_CR6","unstructured":"Knuth,E.,Petri Nets and regular trace languages, Univ. of Newcastle upon Tyne,Comp.Lab.,ASM\/47,1978."},{"key":"6_CR7","volume-title":"Semigroups and combinatorial applications","author":"G. Lallement","year":"1979","unstructured":"Lallement,G.,Semigroups and combinatorial applications,J.Wiley and Sons, New York,1979."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz,A.,Concurrent program schemes and their interpretations, DAIMI,PB 78,Aarhus University,1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"6_CR9","volume-title":"ISF Rep.77\/01","author":"C.A. Petri","year":"1977","unstructured":"Petri,C.A.,Non sequential processes,ISF Rep.77\/01,GMD Bonn,1977."},{"key":"6_CR10","volume-title":"Trace languages and closure operations,Automata Theoretic Letters,1979\/2","author":"M. Szijarto","year":"1979","unstructured":"Szijarto,M.,Trace languages and closure operations,Automata Theoretic Letters,1979\/2,Dept.of numerical and computer math., L.Eotvos University, Budapest,1979."},{"key":"6_CR11","first-page":"88","volume":"2","author":"P.C. Fisher","year":"1968","unstructured":"Fisher,P.C.,Rosenberg,A.L.,Multitape non writing automata,J.C.S.S., 2,1968,pp.88\u2013101.","journal-title":"J.C.S.S."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:59:03Z","timestamp":1558256343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0012757","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}