Chapter PDF
References
M. Anselmo, D. Giammarresi, M. Madonia. Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages. Procs. CIAA07, LNCS 44783, 290-302, Springer Verlag, 2007.
M. Anselmo, D. Giammarresi, M. Madonia. From Determinism to Non-determinism in Recognizable Two-dimensional Languages.Procs. DLT07, LNCS 4588, 36-47, Springer Verlag, 2007.
M. Anselmo, D. Giammarresi, M. Madonia, A. Restivo. Unambiguous Recognizable two-dimensional languages. RAIRO - Inf. Theor. Appl. 40 (2006) 277-293
4. M. Anselmo,M. Madonia Deterministic and Unambiguous Two-dimensional Languages over One-letter Alphabet.Theoretical Computer Science, to appear.
A. Bertoni, M. Goldwurm, V. Lonati. On the Complexity of Unary Tiling-Recognizable Picture Languages. Procs. STACS’07, LNCS 4393, 381-392, Springer Verlag, 2007.
J. Berstel, C. Reutenauer. Rational series and their languages. EATCS monographs on Theoretical Computer Science. Springer 1988.
M. Blum and C. Hewitt. Automata on a two-dimensional tape. IEEE Symposium on Switching and Automata Theory, pages 155–160, 1967.
8. J. Cervelle Langages de Figures. Rapport de Stage. Ecole Normale Supériure de Lyon, Dept de Mathématiques et Informatique, 1997.
S. Crespi Reghizzi, M. Pradella. A SAT-based parser and completer for pictures specified by tiling. Pattern Recognition 41(2): 555-566 (2008).
De Prophetis, L., Varricchio, S.: Recognizability of rectangular pictures by wang systems. Journal of Automata, Languages, Combinatorics. 2 (1997) 269-288
11. S. Eilenberg. Automata, Languages and Machines. Vol. A, Academic Press, 1974.
12. D. Giammarresi. Two-dimensional languages and recognizable functions. In Proc. Developments in language theory, Finland, 1993. G.Rozenberg and A. Salomaa (Eds). World Scientific Publishing Co. , 1994.
D. Giammarresi, A. Restivo. Recognizable picture languages. Int. Journal Pattern Recognition and Artificial Intelligence. Vol. 6, No. 2& 3, pages 241 –256, 1992.
D. Giammarresi, A. Restivo. Two-dimensional languages. Handbook of Formal Languages, G. Rozenberg, et al. Eds, Vol. III, pag. 215–268. Springer Verlag, 1997.
D. Giammarresi, A. Restivo. Matrix-based complexity functions and recognizable picture languages. In Logic and Automata: History and Perspectives. E. Grader, J. Flum,T. Wilke Eds. , pag 315-337. Texts in Logic and Games 2. Amsterdam University Press, 2007.
D. Giammarresi, A. Restivo, S. Seibert, W. Thomas. Monadic second order logic over pictures and recognizability by tiling systems. Information and Computation, Vol 125, 1, 32–45, 1996.
I. Glaister, J. Shallit. A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters, pages 125:32, vol 45, 1996.
J. Hromkovic, J. Karumöki, H. Klauck, G. Schnitger, S. Seibert. Communication Complexity Method for Measuring Nondeterminism in Finite Automata. Information and Computation, Vol. 172, pag 202-217, 2002.
K. Inoue and I. Takanami. A Characterization of recognizable picture languages. In Proc. Second International Colloquium on Parallel Image Processing, A. Nakamuraet al. (Eds.), Lecture Notes in Computer Science 654, Springer-Verlag, Berlin 1993.
O. Matz. On piecewise testable, starfree, and recognizable picture languages. In Foundations of Software Science and Computation Structures, M. Nivat, Ed., vol. 1378, Springer-Verlag, Berlin, 1998.
O. Matz. Dot-Depth and Monadic Quantifier Alternation over Pictures Technical Report 99-08, Rheinisch-Westflischen Technischen Hochschule Aachen, 1999. http://automata.rwth-aachen.de/matz/bibliography.html#MatzDiss.
O. Matz, W. Thomas. The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. In IEEE Symposium on Logic in Computer Science, LICS. IEEE 1997: 236-244
I. Möurer. Weighted Picture Automata and Weighted Logics. In B. Durand, W. Thomas (Eds.)Procs. STACS 2006, LNCS 3885, pp. 313-324, Springer-Verlag, 2006.
A. Potthoff, S. Seibert, W. Thomas. Nondeterminism versus determinism of finite automata over directed acyclic graphs. Bull. Belgian Math. Soc. 1, pages 285–298, 1994.
K. Reinhardt. On Some Recognizable Picture-Languages. In Proc. 23rd MFCS 1998, pages 760-770, LNCS 1450, Springer-Verlag, Berlin, 1998.
K. Reinhardt. The #a = #b Pictures Are Recognizable. In Proc. 18th STACS 2001, pages 527-538, LNCS 2010, Springer-Verlag, Berlin, 2001.
A. Salomaa, M. Soittola. Authomata-Theoretic Aspect of Formal Power Series. Springer, 1978.
M. P. Schützenberger. On the definition of a family of automata. Information and Control. vol.4, pp. 245–270, 1961.
W. Thomas. On Logics, Tilings, and Automata. In Proc. 18th ICALP, pages 441–453, LNCS 510, Springer-Verlag, Berlin, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Giammarresi, D., Restivo, A. (2008). Ambiguity and Complementation in Recognizable Two-dimensional Languages. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_1
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)