{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:56:07Z","timestamp":1794340567122,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540637462","type":"print"},{"value":"9783540696407","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0052078","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T01:02:10Z","timestamp":1149642130000},"page":"79-105","source":"Crossref","is-referenced-by-count":0,"title":["Syntactic and semantic aspects of parallelism"],"prefix":"10.1007","author":[{"given":"Alexandru","family":"Mateescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,16]]},"reference":[{"key":"7_CR1","volume-title":"Concurrent Programming Fundamental Techniques for Real Time and Parallel Software Design","author":"T. Axford","year":"1989","unstructured":"T. Axford, Concurrent Programming Fundamental Techniques for Real Time and Parallel Software Design, John Wiley &: Sons, New York, 1989."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and W. P. Weijland, Process Algebra, Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"J. A. Bergstra and J. W. Klop, \u201cProcess Algebra for Synchronous Communication\u201d, Information and Control, 60 (1984), 109\u2013137.","journal-title":"Information and Control"},{"key":"7_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92151-2","volume-title":"Automatentheorie","author":"W. Brauer","year":"1984","unstructured":"W. Brauer, Automatentheorie, B.G. Teubner, Stuttgart, 1984."},{"key":"7_CR5","unstructured":"J. S. Golan, A. Mateescu and D. Vaida, \u201cSemirings and Parallel Composition of Processes\u201d, Journal of Automata, Languages and Combinatorics, to appear."},{"key":"7_CR6","unstructured":"L. Guo, K. Salomaa and S. Yu, Synchronization Expressions and Languages, The University of Western Ontario London, Dept. of Comp. Sci., Technical Report 368, 1993."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"T. Harju, M. Lipponen and A. Mateescu, \u201cFlatwords and Post Correspondence Problem\u201d, Theoretical Computer Science, to appear.","DOI":"10.1016\/0304-3975(95)00092-5"},{"key":"7_CR8","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy, Algebraic Theory of Processes, The MIT Press, Cambridge, Massachusetts, London, 1988."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G.H. Higman","year":"1952","unstructured":"G.H. Higman, \u201cOrdering by divisibility in abstract algebras\u201d, Proc. London Math. Soc., 3, (1952) 326\u2013336.","journal-title":"Proc. London Math. Soc."},{"key":"7_CR10","volume-title":"PhD Thesis","author":"L. Kari","year":"1991","unstructured":"L. Kari, On insertion and deletion in formal languages, PhD Thesis, University of Turku, Turku, Finland, 1991."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science, LNCS 965","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-60249-6_63","volume-title":"FCT'95","author":"M. Kudlek","year":"1995","unstructured":"M. Kudlek and A. Mateescu, \u201cDistributed Catenation and Chomsky Hierarchy\u201d, FCT'95, Dresden, 1995, Lecture Notes in Computer Science, LNCS 965, Springer-Verlag, 1995, 313\u2013322."},{"key":"7_CR12","first-page":"129","volume-title":"Developments in Language Theory II","author":"M. Kudlek","year":"1996","unstructured":"M. Kudlek and A. Mateescu, \u201cRational and Algebraic Languages with Distributed Catenation\u201d, DLT'95, Magdeburg, 1995, in Developments in Language Theory II, eds. J. Dassow, G. Rozenberg and A. Salomaa, World Scientific, Singapore, 1996, 129\u2013138."},{"key":"7_CR13","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"W. Kuich","year":"1986","unstructured":"W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1986."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"A. Mateescu, \u201cOn (Left) Partial Shuffle\u201d, Results and Trends in Theoretical Computer Science, LNCS 812, Springer-Verlag, (1994) 264\u2013278.","DOI":"10.1007\/3-540-58131-6_52"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"A. Mateescu and A. Salomaa, \u201cFormal Languages: an Introduction and a Synopsis\u201d, Chapter 1, in Handbook of Formal Languages, eds. G. Rozenberg and A. Salomaa, Springer-Verlag, to appear.","DOI":"10.1007\/978-3-642-59136-5_1"},{"key":"7_CR16","unstructured":"A. Mateescu and A. Salomaa, \u201cParallel Composition of Words with Re-entrant Symbols\u201d, TUCS Technical Report, 15, 1996."},{"key":"7_CR17","unstructured":"A. Mateescu, K. Salomaa and S. Yu, \u201cDecidability of Fairness for Context-Free Languages\u201d, submitted."},{"issue":"54","key":"7_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0019-9958(82)80020-X","volume":"3","author":"H. A. Maurer","year":"1982","unstructured":"H. A. Maurer, G. Rozenberg and E. Welzl, \u201cUsing String Languages to Describe Picture Languages\u201d, Information and Control, 3, 54, (1982) 155\u2013185.","journal-title":"Information and Control"},{"key":"7_CR19","unstructured":"R. Milner; Communication and Concurrency, Prentice Hall International. 1989."},{"key":"7_CR20","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"A. Salomaa, Formal Languages, Academic Press, New York, 1973."}],"container-title":["Lecture Notes in Computer Science","Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0052078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T02:28:02Z","timestamp":1555640882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0052078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637462","9783540696407"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0052078","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0052071","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}