2008 |
27 | EE | Dora Giammarresi,
Antonio Restivo:
Ambiguity and Complementation in Recognizable Two-dimensional Languages.
IFIP TCS 2008: 5-20 |
2007 |
26 | EE | Dora Giammarresi:
Tiling Recognizable Two-Dimensional Languages.
CAI 2007: 75-86 |
25 | EE | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.
CIAA 2007: 290-302 |
24 | EE | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.
Developments in Language Theory 2007: 36-47 |
2005 |
23 | EE | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
New operations and regular expressions for two-dimensional languages over one-letter alphabet.
Theor. Comput. Sci. 340(1): 408-431 (2005) |
2004 |
22 | EE | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet.
Developments in Language Theory 2004: 63-75 |
21 | EE | Dora Giammarresi,
Jean-Luc Ponty,
Derick Wood,
Djelloul Ziadi:
A characterization of Thompson digraphs.
Discrete Applied Mathematics 134(1-3): 317-337 (2004) |
2003 |
20 | EE | Dora Giammarresi:
Computing Languages by (Bounded) Local Sets.
Developments in Language Theory 2003: 304-315 |
2002 |
19 | EE | Marcella Anselmo,
Dora Giammarresi,
Stefano Varricchio:
Finite Automata and Non-self-Embedding Grammars.
CIAA 2002: 47-56 |
2001 |
18 | EE | Dora Giammarresi,
Rosa Montalbano,
Derick Wood:
Block-Deterministic Regular Languages.
ICTCS 2001: 184-196 |
17 | EE | Jürgen Albert,
Dora Giammarresi,
Derick Wood:
Normal form algorithms for extended context-free grammars.
Theor. Comput. Sci. 267(1-2): 35-47 (2001) |
1999 |
16 | | Dora Giammarresi,
Jean-Luc Ponty,
Derick Wood:
Thompson Languages.
Jewels are Forever 1999: 16-24 |
15 | EE | Dora Giammarresi,
Jean-Luc Ponty,
Derick Wood:
Thompson Digraphs: A Characterization.
WIA 1999: 91-100 |
14 | EE | Dora Giammarresi,
Antonio Restivo:
Extending Formal Language Hierarchies to Higher Dimensions.
ACM Comput. Surv. 31(3es): 12 (1999) |
13 | EE | Dora Giammarresi,
Rosa Montalbano:
Deterministic Generalized Automata.
Theor. Comput. Sci. 215(1-2): 191-208 (1999) |
1998 |
12 | EE | Jürgen Albert,
Dora Giammarresi,
Derick Wood:
Extended Context-Free Grammars and Normal Form Algorithms.
Workshop on Implementing Automata 1998: 1-12 |
11 | EE | Dora Giammarresi,
Sabrina Mantaci,
Filippo Mignosi,
Antonio Restivo:
Periodicities on Trees.
Theor. Comput. Sci. 205(1-2): 145-181 (1998) |
1996 |
10 | | Dora Giammarresi,
Giuseppe F. Italiano:
Decremental 2- and 3-Connectivity on Planar Graphs.
Algorithmica 16(3): 263-287 (1996) |
9 | | Dora Giammarresi,
Antonio Restivo:
Two-Dimensional Finite State Recognizability.
Fundam. Inform. 25(3): 399-422 (1996) |
8 | | Dora Giammarresi,
Antonio Restivo,
Sebastian Seibert,
Wolfgang Thomas:
Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems.
Inf. Comput. 125(1): 32-45 (1996) |
1995 |
7 | | Dora Giammarresi:
Finite State Recognizability for Two-Dimensional Languages: A Brief Survey.
Developments in Language Theory 1995: 299-308 |
6 | | Dora Giammarresi,
Rosa Montalbano:
Deterministic Generalized Automata.
STACS 1995: 325-336 |
1994 |
5 | | Dora Giammarresi,
Sabrina Mantaci,
Filippo Mignosi,
Antonio Restivo:
A Periodicity Theorem for Trees.
IFIP Congress (1) 1994: 473-478 |
4 | | Dora Giammarresi,
Antonio Restivo,
Sebastian Seibert,
Wolfgang Thomas:
Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems.
STACS 1994: 365-375 |
1993 |
3 | | Dora Giammarresi:
Two-Dimensional Languages and Recognizable Functions.
Developments in Language Theory 1993: 290-301 |
1992 |
2 | | Dora Giammarresi,
Giuseppe F. Italiano:
Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version).
SWAT 1992: 221-232 |
1 | | Dora Giammarresi,
Antonio Restivo:
Recognizable Picture Languages.
IJPRAI 6(2&3): 241-256 (1992) |