{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T10:00:32Z","timestamp":1794391232511,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642223204","type":"print"},{"value":"9783642223211","type":"electronic"}],"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-22321-1_13","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"141-152","source":"Crossref","is-referenced-by-count":1,"title":["Simulations over Two-Dimensional On-Line Tessellation Automata"],"prefix":"10.1007","author":[{"given":"G\u00e9rard","family":"C\u00e9c\u00e9","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alain","family":"Giorgetti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-78800-3_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 93\u2013108. Springer, Heidelberg (2008)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-12002-2_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"2010","unstructured":"Abdulla, P.A., Chen, Y.F., Hol\u00edk, L., Mayr, R., Vojnar, T.: When Simulation Meets Antichains. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 158\u2013174. Springer, Heidelberg (2010)"},{"issue":"1-2","key":"13_CR3","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jlap.2006.02.001","volume":"69","author":"P.A. Abdulla","year":"2006","unstructured":"Abdulla, P.A., Legay, A., d\u2019Orso, J., Rezine, A.: Tree regular model checking: A simulation-based approach. J. Log. Algebr. Program.\u00a069(1-2), 93\u2013121 (2006)","journal-title":"J. Log. Algebr. Program."},{"issue":"37","key":"13_CR4","doi-asserted-by":"publisher","first-page":"3520","DOI":"10.1016\/j.tcs.2009.03.016","volume":"410","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci.\u00a0410(37), 3520\u20133529 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2\/3","key":"13_CR5","first-page":"159","volume":"10","author":"S. Bozapalidis","year":"2005","unstructured":"Bozapalidis, S., Grammatikopoulou, A.: Recognizable Picture Series. Journal of Automata, Languages and Combinatorics\u00a010(2\/3), 159\u2013183 (2005)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/635499.635502","volume":"4","author":"D. Bustan","year":"2003","unstructured":"Bustan, D., Grumberg, O.: Simulation-based minimization. ACM Trans. Comput. Logic\u00a04(2), 181\u2013206 (2003)","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR7","unstructured":"C\u00e9c\u00e9, G., Giorgetti, A.: Simulations for a Class of Two-Dimensional Automata. Research Report RR-7425, INRIA (October 2010), \n                    \n                      http:\/\/hal.inria.fr\/inria-00527077\/en\/"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-03564-7_2","volume-title":"Algebraic Informatics","author":"A. Cherubini","year":"2009","unstructured":"Cherubini, A., Pradella, M.: Picture Languages: From Wang Tiles to 2D Grammars. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2009. LNCS, vol.\u00a05725, pp. 13\u201346. Springer, Heidelberg (2009)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-Dimensional Languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, Beyond Words, vol.\u00a03, pp. 215\u2013267. Springer, Berlin (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1977","unstructured":"Inoue, K., Nakamura, A.: Some properties of two-dimensional on-line tessellation acceptors. Inf. Sci.\u00a013(2), 95\u2013121 (1977)","journal-title":"Inf. Sci."},{"issue":"5-6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K. Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordahl, M.: Complexity of Two-Dimensional Patterns. Journal of Statistical Physics\u00a091(5-6), 909\u2013951 (1998)","journal-title":"Journal of Statistical Physics"},{"issue":"4","key":"13_CR12","first-page":"73","volume":"12","author":"V. Lonati","year":"2010","unstructured":"Lonati, V., Pradella, M.: Deterministic recognizability of picture languages with Wang automata. Discrete Math. & Theor. Comput. Sci.\u00a012(4), 73\u201394 (2010)","journal-title":"Discrete Math. & Theor. Comput. Sci."},{"key":"13_CR13","unstructured":"Milner, R.: An Algebraic Definition of Simulation Between Programs. In: IJCAI, pp. 481\u2013489 (1971)"},{"key":"13_CR14","unstructured":"The Smart Surface Project (2010), \n                    \n                      http:\/\/www.smartsurface.cnrs.fr\/"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0304-3975(01)00229-8","volume":"292","author":"W. Thomas","year":"2003","unstructured":"Thomas, W.: Uniform and nonuniform recognizability. Theor. Comput. Sci.\u00a0292(1), 299\u2013316 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22321-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T23:37:46Z","timestamp":1553902666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_13","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}