Dora Giammarresi, Selected Papers

• Two-dimensional languages. In Handbook of Formal Languages G. Rosenberg and A. Salomaa Eds. Vol. III, pag. 215 -- 268. Springer Verlag, 1997.  Poscript version
• Recognizable picture languages, International Journal on Pattern Recognition and Artificial Intelligence. Vol. 6, No. 2 and 3, pag. 241--256, 1992.(with A. Restivo)
• Monadic second order logic over rectangular pictures and recognizability by tiling systems. Information and Computation, Vol.125, No.1, pag. 32--45, 1996. Also in Proc. STACS '94. LNCS, Vol. 775, pag. 365--376, Springer-Verlag, Berlin 1994. (with A. Restivo, S. Seibert, W. Thomas)
• Two-dimensional finite state recognizability. Fundamenta Informaticae. Special Issue: Formal Language Theory, vol. 25, no. 3,4 (1996), 399--422. (with A. Restivo.)
• Two-dimensional languages and recognizable functions. Proc. Developments in Language Theory (DLT'93), G.Rozenberg and A. Salomaa, Eds. pag. 290--301. World Scientific Publishing Co., 1994.
• Finite state recognizability for two-dimensional languages: a brief survey. Invited lecture. Proc. Developments in Language Theory (DLT'95). J. Dassow, G.Rozenberg, A. Salomaa Eds. pag. 299--308. World Scientific Publishing Co. 1996.
• Extending formal languages hierarchies to higher dimensions. Computing Surveys Symposium on "Theoretical Computer Science: A Perspective". Degano et al. Eds. ACM Computing Surveys, vol. 31, 1999. (with A. Restivo.) Poscript.
• Describing Computations by (Bounded) Local Sets. Tech. Report 2000-05 Universita' Ca' Foscari di Venezia.
  

    Finite State Automata

• Deterministic Generalized Automata. Theoretical Computer Science, Vol. 215, 1-2, pag. 191--208, Elsevier, 1999. Also in Proc. STACS '95. LNCS, Vol. 900, pag. 325--336 Springer-Verlag, Berlin 1995. (with R. Montalbano) Poscript.
• Block-Deterministic Regular Languages. Proc. ICTCS 2001, A.Restivo et al Eds.  LNCS, Vol. 2002, pp. 184-196.
  Springer-Verlag, Berlin, 2001.(with R. Montalbano and D. Wood.) Poscript.
• Thompson Languages. J, Karhumaki, H. Maurer, Gh. Paun and G. Rozenberg Eds., Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pp. 15--24. Springer, 1999. (with J. Ponty and D. Wood.) Poscript.
• Thompson Digraphs: A Characterization. Proc. Workshop on Implementing automata (WIA'99), LNCS, Springer-Verlag, Berlin, 2000. (with J.L. Ponty, D. Wood.)
• Glushkov and Thompson construction: a syntesis. Tech. Report 98-17. Universita' Ca' Foscari di Venezia. (with J.L. Ponty, D. Wood.) Poscript.
• A Characterization of Thompson Digraphs. Tech. Report 99-8. Universita' Ca' Foscari di Venezia.(with J.L. Ponty, D. Wood.)

    Context-free Grammars

• Normal Form Algorithms for Extended Context-Free Grammars. Theoretical Computer Science, Elsevier. To appear . Also Proc. WIA 98. LNCS 1660, pagg 1-9 .Springer Verlag 1999. (with J. Albert, D. Wood) (Poscript)
• Transition Diagram Systems and Normal Form Algorithms. Proc. Italian Conference on Theoretical Computer Science (ICTCS'98), P.Degano et al. Eds. pag. 359--370 Word Scientific, 1998. (with D. Wood) Poscript.

    Combinatorics on Trees

• Periodicities on trees. Theoretical Computer Science,Vol. 205, 1-2, pag. 145--181, Elsevier, 1998. (with S. Mantaci, F. Mignosi, A. Restivo.) (Poscript)
• A periodicity theorem for trees. Proc. 13th World Computer Congress - IFIP '94; Vol. A-51 pag. 473--478. Elsevier Science B.V. (North-Holland), 1994. (with S. Mantaci, F. Mignosi, A. Restivo.)
• Congruences, automata and periodicities. Proc. Workshop Semigroups, Automata and Languages, 1994. J.Almeida and P.Silva Eds., pag.125--135. World Scientific Publishing Co., 1995. (with S. Mantaci, F. Mignosi, A. Restivo.)

     Graph Algorithms

• Decremental 2- and 3-connectivity on planar graphs, Algorithmica vol. 16, no. 3 (1996), 263--287. Also in Proc. SWAT'92. LNCS Vol. 621, pag. 221-232. Springer-Verlag, Berlin, 1992. (with G. F. Italiano)