{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:31Z","timestamp":1725577411338},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_15","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T08:56:14Z","timestamp":1296809774000},"page":"135-142","source":"Crossref","is-referenced-by-count":0,"title":["Symbolic Dynamics, Flower Automata and Infinite Traces"],"prefix":"10.1007","author":[{"given":"Wit","family":"Fory\u015b","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Oprocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Slawomir","family":"Bakalarski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","volume-title":"Theory of codes, Pure and Applied Mathematics","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of codes, Pure and Applied Mathematics, vol.\u00a0117. Academic Press Inc., Orlando (1985)"},{"key":"15_CR2","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079468","volume-title":"Probl\u00e8mes combinatories de commutation et r\u00e9arrangements","author":"P. Cartier","year":"1969","unstructured":"Cartier, P., Foata, D.: Probl\u00e8mes combinatories de commutation et r\u00e9arrangements. Lecture Notes in Mathematics. Springer, Heidelberg (1969)"},{"key":"15_CR3","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)"},{"volume-title":"The book of traces","year":"1995","key":"15_CR4","unstructured":"Diekert, V., Rozenberg, G. (eds.): The book of traces. World Scientific Publishing Co. Inc., River Edge (1995)"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00224-007-9093-7","volume":"45","author":"W. Fory\u015b","year":"2009","unstructured":"Fory\u015b, W., Oprocha, P.: Infinite Traces and Symbolic Dynamics. Theory Comput. Syst.\u00a045, 133\u2013149 (2009)","journal-title":"Theory Comput. Syst."},{"key":"15_CR6","unstructured":"Fory\u015b, W., Oprocha, P.: Infinite Traces and Symbolic Dynamics - Minimal Shift Case. Fundamenta Informatica (to appear)"},{"key":"15_CR7","unstructured":"Garcia Guirao, J.L., Fory\u015b, W., Oprocha, P.: A dynamical model of parallel computation on bi-infinite time-scale. J.Comput. Appl. Math. (to appear)"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/3-540-16047-7_48","volume-title":"ACS 1985","author":"A. Kaldewaij","year":"1985","unstructured":"Kaldewaij, A.: Trace theory and the specification of concurrent systems. In: Denvir, B.T., Jackson, M.I., Harwood, W.T., Wray, M.J. (eds.) ACS 1985. LNCS, vol.\u00a0207, pp. 211\u2013221. Springer, Heidelberg (1985)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"K\u016frka, P: Topological and Symbolic Dynamics. Cours Sp\u00e9cialis\u00e9s [Specialized Courses] 11. Soci\u00e9t\u00e9 Math\u00e9matique de France, Paris (2003)","DOI":"10.1515\/dmvm-2003-0028"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(90)90061-2","volume":"35","author":"M. Kwiatkowska","year":"1990","unstructured":"Kwiatkowska, M.: A metric for traces. Inform. Process. Lett.\u00a035, 129\u2013135 (1990)","journal-title":"Inform. Process. Lett."},{"key":"15_CR11","first-page":"1","volume":"78","author":"A. Mazurkiewicz","year":"1977","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. Aarhus University\u00a078, 1\u201345 (1977)","journal-title":"DAIMI Rep. Aarhus University"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(89)90049-2","volume":"65","author":"A. Restivo","year":"1989","unstructured":"Restivo, A.: Finitely generated sofic systems. Theoret. Comput. Sci.\u00a065, 265\u2013270 (1989)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1090\/S0002-9939-1990-1025283-2","volume":"110","author":"S. Williams","year":"1990","unstructured":"Williams, S.: Notes on renewal systems. Proc. Amer. Math. Soc.\u00a0110, 851\u2013853 (1990)","journal-title":"Proc. Amer. Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T06:18:24Z","timestamp":1559974704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}