{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:47:49Z","timestamp":1725468469873},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055827","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:36:31Z","timestamp":1155836191000},"page":"760-770","source":"Crossref","is-referenced-by-count":10,"title":["On some recognizable picture-languages"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Reinhardt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"74_CR1","unstructured":"E. Allender and K. Reinhardt. Isolation matching and counting. to appear in Proc. of 13th Computational Complexity, 1998."},{"issue":"1","key":"74_CR2","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1995.1100","volume":"120","author":"R. Fagin","year":"1995","unstructured":"Ronald Fagin, Larry J. Stockmeyer, and Moshe Y. Vardi. On monadic NP vs. monadic co-NP. Information and Computation, 120(1):78\u201392, July 1995.","journal-title":"Information and Computation"},{"key":"74_CR3","doi-asserted-by":"crossref","unstructured":"Martin F\u00fcrer. The tight deterministic time hierarchy. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 8\u201316, San Francisco, California, 5\u20137 May 1982.","DOI":"10.1145\/800070.802172"},{"key":"74_CR4","volume-title":"Handbook of Formal Language Theory, volume III","author":"D. Giammarresi","year":"1996","unstructured":"D. Giammarresi and A. Restivo. Two-dimensional languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III. Springer-Verlag, New York, 1996."},{"key":"74_CR5","first-page":"365","volume-title":"LNCS 775","author":"D. Giammarresi","year":"1994","unstructured":"Dora Giammarresi, Antonio Restivo, Sebastian Seibert, and Wolfgang Thomas. Monadic second-order logic over pictures and recognizability by tiling systems. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science, STACS 94 (Caen, France, February 1994), LNCS 775, pages 365\u2013375, Berlin-Heidelberg-New York-LondonParis-Tokyo-Hong Kong-Barcelona-Budapest, 1994. Springer-Verlag."},{"key":"74_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(77)90023-8","volume":"13","author":"K. Inoue","year":"1977","unstructured":"K. Inoue and A. Nakamura. Some properties of two-dimensional on-line tessellation acceptors. Information Sciences, 13:95\u2013121, 1977.","journal-title":"Information Sciences"},{"key":"74_CR7","first-page":"283","volume-title":"volume 1200 of lncs","author":"O. Matz","year":"1997","unstructured":"Oliver Matz. Regular expressions and context-free grammars for picture languages. In 14th Annual Symposium on Theoretical Aspects of Computer Science, volume 1200 of lncs, pages 283\u2013294, L\u00fcbeck, Germany, 27 February\u2013March 1 1997. Springer."},{"key":"74_CR8","doi-asserted-by":"crossref","unstructured":"Oliver Matz. On piecewise testable, starfree, and recognizable picture languages. In Maurice Nivat, editor, Foundations of Software Science and Computation Structures, volume 1378 of Lecture Notes in Computer Science, pages 203\u2013210. Springer, 1998.","DOI":"10.1007\/BFb0053551"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"K. Reinhardt and E. Allender. Making nondeterminism unambiguous. In 38 th IEEE Symposium on Foundations of Computer Science (FOCS), pages 244\u2013253, 1997.","DOI":"10.1109\/SFCS.1997.646113"},{"key":"74_CR10","first-page":"347","volume-title":"Automata, Languages and Programming, volume 1256 of Lect. Notes Comput. Sci.","author":"T. Wilke","year":"1997","unstructured":"Thomas Wilke. Star-free picture expressions are strictly weaker than firstorder logic. In Pierpaolo Degano, Roberto Gorrieri, and Alberto Marchetti-Spaccamela, editors, Automata, Languages and Programming, volume 1256 of Lect. Notes Comput. Sci., pages 347\u2013357, Bologna, Italy, 1997. Springer."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T18:44:18Z","timestamp":1555785858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0055827","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}