{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:38:52Z","timestamp":1725536332067},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642035630"},{"type":"electronic","value":"9783642035647"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03564-7_9","type":"book-chapter","created":{"date-parts":[[2009,8,20]],"date-time":"2009-08-20T03:05:35Z","timestamp":1250737535000},"page":"147-159","source":"Crossref","is-referenced-by-count":1,"title":["A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.tcs.2005.03.031","volume":"340","author":"M. Anselmo","year":"2005","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: New Operators and Regular Expressions for two-dimensional languages over one-letter alphabet. Theoretical Computer Science\u00a0340(2), 408\u2013431 (2005)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-73208-2_7","volume-title":"Developments in Language Theory","author":"M. Anselmo","year":"2007","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: From determinism to non-determinism in recognizable two-dimensional languages. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 36\u201347. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR3","first-page":"227","volume":"40","author":"M. Anselmo","year":"2006","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Restivo, A.: Unambiguous Recognizable Two-dimensional Languages. RAIRO: Theoretical Informatics and Applications\u00a040(2), 227\u2013294 (2006)","journal-title":"RAIRO: Theoretical Informatics and Applications"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-95891-8_11","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Jonoska, N., Madonia, M.: Framed Versus Unframed Two-dimensional Languages. In: Nielsen, M., Kucera, A., Miltersen, P.B., Palamidessi, C., Tuma, P., Valencia, F.D. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 79\u201392. Springer, Heidelberg (2009)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-75414-5_9","volume-title":"Algebraic Informatics","author":"M. Anselmo","year":"2007","unstructured":"Anselmo, M., Madonia, M.: Deterministic two-dimensional languages over one-letter alphabet. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol.\u00a04728, pp. 147\u2013159. Springer, Heidelberg (2007)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1016\/j.tcs.2008.12.009","volume":"410","author":"M. Anselmo","year":"2009","unstructured":"Anselmo, M., Madonia, M.: Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theoretical Computer Science\u00a0410, 1477\u20131485 (2009)","journal-title":"Theoretical Computer Science"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-70918-3_33","volume-title":"STACS 2007","author":"A. Bertoni","year":"2007","unstructured":"Bertoni, A., Goldwurm, M., Lonati, V.: On the complexity of unary tiling-recognizable picture languages. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 381\u2013392. Springer, Heidelberg (2007)"},{"key":"9_CR8","unstructured":"Cervelle, J.: Langages de figures. Rapport de stage, ENS de Lyon (1997)"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(86)90142-8","volume":"47","author":"M. Chrobak","year":"1986","unstructured":"Chrobak, M.: Finite automata and unary languages. Theoret. Comput. Sci.\u00a047, 149\u2013158 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR10","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"issue":"2&3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S021800149200014X","volume":"6","author":"D. Giammarresi","year":"1992","unstructured":"Giammarresi, D., Restivo, A.: Recognizable picture languages. Int. Journal Pattern Recognition and Artificial Intelligence\u00a06(2&3), 241\u2013256 (1992)","journal-title":"Int. Journal Pattern Recognition and Artificial Intelligence"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-59126-6_4","volume-title":"Handbook of Formal Languages","author":"D. Giammarresi","year":"1997","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., et al. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 215\u2013268. Springer, Heidelberg (1997)"},{"key":"9_CR13","unstructured":"Giammarresi, D., Restivo, A.: Matrix based complexity functions and recognizable picture languages. In: Grader, E., Flum, J., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games 2, pp. 315\u2013337. Amsterdam University Press (2007)"},{"key":"9_CR14","series-title":"IFIP","first-page":"5","volume-title":"Procs. Intern. Conf. on Theoret. Compu. Sci.","author":"D. Giammarresi","year":"2008","unstructured":"Giammarresi, D., Restivo, A.: Ambiguity and complementation in recognizable two-dimensional languages. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) Procs. Intern. Conf. on Theoret. Compu. Sci. IFIP, vol.\u00a0273, pp. 5\u201320. Springer, Boston (2008)"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1006\/inco.2001.3069","volume":"172","author":"J. Hromkovic","year":"2002","unstructured":"Hromkovic, J., Karum\u00e4ki, J., Klauck, H., Schnitger, G., Seibert, S.: Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Information and Computation\u00a0172, 202\u2013217 (2002)","journal-title":"Information and Computation"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S012905419100011X","volume":"2","author":"T. Jiang","year":"1991","unstructured":"Jiang, T., McDowell, E., Ravikumar, B.: The structure and complexity of minimal nfa\u2019s over a unary alphabet. Intern. J. Found. Comput. Sci.\u00a02, 163\u2013182 (1991)","journal-title":"Intern. J. Found. Comput. Sci."},{"issue":"5-6","key":"9_CR17","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"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0053551","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Matz","year":"1998","unstructured":"Matz, O.: On piecewise testable, starfree, and recognizable picture languages. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.\u00a01378, p. 203. Springer, Heidelberg (1998)"},{"key":"9_CR19","unstructured":"Matz, O.: Dot-depth and monadic quantifier alternation over pictures. Ph.D. thesis Technical Report 99-08, RWTH Aachen (1999)"},{"issue":"1-2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(01)00277-8","volume":"270","author":"O. Matz","year":"2002","unstructured":"Matz, O.: Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures. Theoretical Computer Science\u00a0270(1-2), 1\u201370 (2002)","journal-title":"Theoretical Computer Science"},{"key":"9_CR21","unstructured":"M\u00e4urer, I.: Characterizations of Recognizable Picture Series, Ph.D Thesis Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Abteilung Automaten und Sprachen (2007)"},{"key":"9_CR22","doi-asserted-by":"crossref","first-page":"285","DOI":"10.36045\/bbms\/1103408550","volume":"1","author":"A. Potthoff","year":"1994","unstructured":"Potthoff, A., Seibert, S., Thomas, W.: Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belgian Math. Soc.\u00a01, 285\u2013298 (1994)","journal-title":"Bull. Belgian Math. Soc."}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03564-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T11:25:30Z","timestamp":1590060330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03564-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035630","9783642035647"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03564-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}