{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:14:13Z","timestamp":1648937653848},"reference-count":16,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270100071","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T14:54:57Z","timestamp":1486047297000},"page":"7-22","source":"Crossref","is-referenced-by-count":0,"title":["On the structure of recognizable languages of dependence graphs"],"prefix":"10.1051","volume":"27","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. J.","family":"Hoogeboom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"[AR1] AALBERSBERG IJ. J. and ROZENBERG G., Theory of Traces, Theoretical Computer Science, Vol. 60 1988, pp. 1-82.9475320652.68017","DOI":"10.1016\/0304-3975(88)90051-5"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"[AR2] AALBERSBERG IJ. J. and ROZENBERG G., Traces, Dependency Graphs and DNLC Grammars, Discrete Applied Mathematics, Vol. 11 1985, pp. 299-306.7928960601.68045","DOI":"10.1016\/0166-218X(85)90080-0"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"[AW] AALBERSBERG IJ. J. and WELZL E., Trace Languages Defined by Regular String Languages, RAIRO Informatique Th\u00e9orique, Vol. 20 1986, pp. 103-119922508607630612.68071","DOI":"10.1051\/ita\/1986200201031"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"[BMS] BERTON A., MAURI G. and SABADIN N., Equivalence and Membership Problems for Regular Trace Languages, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 61-71.6754450486.68079","DOI":"10.1007\/BFb0012757"},{"key":"R5","unstructured":"[CF] CARTIER P. and FOATA D., Probl\u00e8mes combinatoires de commutation et rearrangements, Lecture Notes in Mathematics, Vol. 85, 1981.0186.30101"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"[CP] CORI R. and PERRIN D., Automates et commutations partielles, RAIRO Informatique Th\u00e9orique, Vol. 19, 1985, pp. 21-32922197957690601.68055","DOI":"10.1051\/ita\/1985190100211"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"[ENR] H. EHRIG, M. NAGL and G. ROZENBERG eds. Graph Grammars and their Applications to Computer Science, Lecture Notes in Computer Science, Vol. 153 1983.7078560512.00027","DOI":"10.1007\/BFb0000094"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"[ER] EHRENFEUCHT A. and ROZENBERG G., On the structure of dependency graphs, in: Concurrency and nets, K. Voss, H. J. GENRICH, G. ROZENBERG Eds., Springer Verlag, 1987, pp. 141-170.9119170642.68031","DOI":"10.1007\/978-3-642-72822-8_11"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"[FR] FL\u00c9 M. P. and ROUCAIROL G., On Serizlizability of Iterated Transactions, Proc. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, 1982, pp. 194-200.","DOI":"10.1145\/800220.806697"},{"key":"R10","unstructured":"[K] KELLER R. M., A Solvable Program-Schema Equivalence Problem, Proc. 5th Annual Princeton Conference on Information Sciences and Systems, Princeton, 1971, pp. 301-306."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"[Ml] MAZURKIEWICZ A., Concurrent Program Schemes and their Interpretations, Dept. of Computer Science, University of Aarhus, Technical Report No. PB-78, Aarhus, 1977.","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"[M2] MAZURKIEWICZ A., Semantics of Concurrent Systems: a Modular Fixed Point Approach, Lecture Notes in Computer Science, Vol. 188, 1985, pp. 353-375.8072090576.68044","DOI":"10.1007\/3-540-15204-0_20"},{"key":"R13","doi-asserted-by":"crossref","unstructured":"[Me] METIVIER Y., Une condition suffisante de reconnaissabilit\u00e9 dans un mono\u00efde partiellement commutatif, RAIRO Informatique Th\u00e9orique, Vol. 20, 1986, pp. 121-127.922518607640599.20107","DOI":"10.1051\/ita\/1986200201211"},{"key":"R14","unstructured":"[O] OCHMANSKI E., Regular Trace Languages, Ph.D. Thesis, Dept. of Mathematics, University of Warsaw, 1985."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"[P] PERRIN D., Partial Commutations, Lecture Notes in Computer Science, Vol. 372, pp. 637-651.1037081","DOI":"10.1007\/BFb0035789"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"[RW] ROZENBERG G. and WELZL E., Boundary NLC grammars. Basic Definitions, Normal Forms and Complexity, Information and Control, Vol. 69, 1986, pp. 136-167.8484380608.68060","DOI":"10.1016\/S0019-9958(86)80045-6"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270100071\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:55:20Z","timestamp":1568786120000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270100071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":16,"journal-issue":{"issue":"1"},"alternative-id":["ita1993270100071"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270100071","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}