{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:02Z","timestamp":1725663242736},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_18","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:00:40Z","timestamp":1330203640000},"page":"185-196","source":"Crossref","is-referenced-by-count":3,"title":["Using generating functions to compute concurrency"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Geniet","sequence":"first","affiliation":[]},{"given":"Lo\u00ffs","family":"Thimonier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"18_CR1","unstructured":"A.Arnold \u2014 M.Nivat, \"Comportements de processus\", L.I.T.P. internal report no 82-12, 1982"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1137\/1016082","volume":"16","author":"E. A. Bender","year":"1974","unstructured":"E.A. Bender, \"Asymptotic methods in enumeration\", SIAM review vol.16 no4, p. 485\u2013515, October 1974","journal-title":"SIAM review"},{"key":"18_CR3","first-page":"211","volume-title":"On a concurrency measure","author":"B. Berard","year":"1988","unstructured":"B. Berard \u2014 L. Thimonier, \"On a concurrency measure\", 2nd I.S.C.I.S. proceeding, Istanbul 1987, pp 211\u2013225 & Nova Science Publishers, New York 1988"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"N. Chomsky \u2014 M.P.Sch\u00fctzenberger, \"The algebraic theory of context-free languages\", Computer Programming and Formal Systems, pp 118\u2013161, North Holland 1963","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"18_CR5","unstructured":"S.Eilenberg, \"Automata Languages and machines\", vol. A, Academic press 1976"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"J.Fran\u00e7on, \"A quantitative approach of mutual exclusion\", R.A.I.R.O. theoretical Informatics and Applications no 20, 1986, pp 275\u2013289","DOI":"10.1051\/ita\/1986200302751"},{"key":"18_CR7","unstructured":"D.Geniet, \"Automaf: un systemes de construction d'automates synchronises et de calcul de mesure du parallelisme\", Thesis, Univ. Paris XI, to appear in 1989"},{"key":"18_CR8","volume-title":"Combinatorial Enumerations","author":"I. Goulden","year":"1983","unstructured":"I. Goulden \u2014 D. Jackson, \"Combinatorial Enumerations\", J. Wiley, New york 1983"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"R.Mac Naughton \u2014 Yamada, \"Regular expressions and state graphs for automata\", I.E.E.E. transactions on electronic computers, EC-9, pp 39\u201347, 1960","DOI":"10.1109\/TEC.1960.5221603"},{"key":"18_CR10","unstructured":"C.Pair \u2014 R.Mohr \u2014 R.Schott, \"Construire les algorithmes\", Dunod informatique 1988"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:34Z","timestamp":1605648094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}