{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:40Z","timestamp":1725489160949},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540002253"},{"type":"electronic","value":"9783540362067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36206-1_11","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:23:08Z","timestamp":1187248988000},"page":"109-120","source":"Crossref","is-referenced-by-count":1,"title":["Generalising Automaticity to Modal Properties of Finite Structures"],"prefix":"10.1007","author":[{"given":"A.","family":"Dawar","sequence":"first","affiliation":[]},{"given":"S.","family":"Kreutzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"11_CR1","unstructured":"A. Arnold and D. Niwi\u0144ski. Rudiments of \u03bc-calculus. North Holland, 2001."},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic. Cambridge University Press, 2001.","DOI":"10.1017\/CBO9781107050884"},{"key":"11_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-44802-0_20","volume-title":"Inflationary fixed points in modal logic","author":"A. Dawar","year":"2001","unstructured":"A. Dawar, E. Gr\u00e4del, and S. Kreutzer. Inflationary fixed points in modal logic. In Proc. of the 10th Conf. on Computer Science Logic (CSL), volume 2142 of LNCS, pages 277\u2013291. Springer, 2001. Full version at http:\/\/www.cl.cam.ac.uk\/\u223dad260\/papers\/mic.ps ."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1\u201368. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"11_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of 7th International Conference on Concurrency Theory CONCUR\u2019 96","author":"D. Janin","year":"1996","unstructured":"D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic. In Proceedings of 7th International Conference on Concurrency Theory CONCUR\u2019 96, volume 1119 of Lecture Notes in Computer Science. Springer-Verlag, 1996."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00314-4","volume":"224","author":"M. Otto","year":"1999","unstructured":"M. Otto. Bisimulation-invariant Ptime and higher-dimensional mu-calculus. Theoretical Computer Science, 224:237\u2013265, 1999.","journal-title":"Theoretical Computer Science"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1006\/jcss.1996.0046","volume":"53","author":"J. Shallit","year":"1996","unstructured":"J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. Journal of Computer and System Sciences, 53:10\u201325, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001.","DOI":"10.1007\/978-1-4757-3550-5"},{"key":"11_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/3-540-54233-7_154","volume-title":"Automata, Languages, and Programming","author":"W. Thomas","year":"1991","unstructured":"W. Thomas. On logics, tilings, and automata. In J. Leach et al., editor, Automata, Languages, and Programming, Lecture Notes in Computer Science Nr. 510, pages 441\u2013453. Springer-Verlag, 1991."},{"key":"11_CR10","first-page":"499","volume":"1","author":"W. Thomas","year":"1994","unstructured":"W. Thomas. Finite-state recognizability and logic: from words to graphs. In 13th World Computer Congress 94, volume 1, pages 499\u2013506. Elsevier Science, 1994.","journal-title":"13th World Computer Congress 94"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"W. Thomas. Languages, automata and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 389\u2013455. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_7"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36206-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:08:10Z","timestamp":1556770090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36206-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002253","9783540362067"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-36206-1_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}