{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:13Z","timestamp":1725544633738},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_56","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"684-695","source":"Crossref","is-referenced-by-count":2,"title":["Weighted Asynchronous Cellular Automata"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Kuske","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1052","volume":"106","author":"R. Cori","year":"1993","unstructured":"Cori, R., M\u00e9tivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation\u00a0106, 159\u2013202 (1993)","journal-title":"Information and Computation"},{"key":"56_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorics on Traces","year":"1990","unstructured":"Diekert, V. (ed.): Combinatorics on Traces. LNCS, vol.\u00a0454. Springer, Heidelberg (1990)"},{"doi-asserted-by":"crossref","unstructured":"Diekert, V., Muscholl, A.: Construction of asynchronous automata. In: [4], pp. 249\u2013267 (1995)","key":"56_CR3","DOI":"10.1142\/9789814261456_0008"},{"key":"56_CR4","doi-asserted-by":"publisher","DOI":"10.1142\/2563","volume-title":"The Book of Traces","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific Publ. Co., Singapore (1995)"},{"key":"56_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/inco.1999.2799","volume":"153","author":"M. Droste","year":"1999","unstructured":"Droste, M., Gastin, P.: The Kleene-Sch\u00fctzenberger theorem for formal power series in partially commuting variables. Information and Computation\u00a0153, 47\u201380 (1999)","journal-title":"Information and Computation"},{"key":"56_CR6","series-title":"Annals of Mathematics Studies","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, vol.\u00a034, pp. 3\u201340. Princeton University Press, Princeton (1956)"},{"doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University (1977)","key":"56_CR7","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"56_CR8","first-page":"56","volume":"27","author":"E. Ochma\u0144ski","year":"1985","unstructured":"Ochma\u0144ski, E.: Regular behaviour of concurrent systems. Bull. Europ. Assoc. for Theor. Comp. Science\u00a027, 56\u201367 (1985)","journal-title":"Bull. Europ. Assoc. for Theor. Comp. Science"},{"key":"56_CR9","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Siottola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Heidelberg (1978)"},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M.P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Inf. Control\u00a04, 245\u2013270 (1961)","journal-title":"Inf. Control"},{"unstructured":"Thomas, W.: On logical definability of trace languages. In: Diekert, V. (ed.) Proceedings of a workshop of the ESPRIT BRA No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, pp. 172\u2013182 (1990)","key":"56_CR11"},{"key":"56_CR12","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. - Informatique Th\u00e9orique et Applications\u00a021, 99\u2013135 (1987)","journal-title":"R.A.I.R.O. - Informatique Th\u00e9orique et Applications"},{"doi-asserted-by":"crossref","unstructured":"Zielonka, W.: Asynchronous automata. In: [4], pp. 205\u2013248 (1995)","key":"56_CR13","DOI":"10.1142\/9789814261456_0007"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:31:43Z","timestamp":1555457503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11672142_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}