 | 2009 |
|---|
| 24 |       | Marcella Anselmo,
Maria Madonia:
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages.
CAI 2009: 147-159 |
| 23 | | Marcella Anselmo,
Natasha Jonoska,
Maria Madonia:
Framed Versus Unframed Two-Dimensional Languages.
SOFSEM 2009: 79-92 |
| 22 | | Marcella Anselmo,
Maria Madonia:
Deterministic and unambiguous two-dimensional languages over one-letter alphabet.
Theor. Comput. Sci. 410(16): 1477-1485 (2009) |
| 21 | | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
A computational model for tiling recognizable two-dimensional languages.
Theor. Comput. Sci. 410(37): 3520-3529 (2009) |
| 2007 |
|---|
| 20 | | Marcella Anselmo,
Maria Madonia:
Deterministic Two-Dimensional Languages over One-Letter Alphabet.
CAI 2007: 147-159 |
| 19 | | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.
CIAA 2007: 290-302 |
| 18 | | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.
Developments in Language Theory 2007: 36-47 |
| 17 | | Marcella Anselmo,
Alessandra Cherubini,
Pierluigi San Pietro:
Regular Languages and Associative Language Descriptions.
Discrete Mathematics & Theoretical Computer Science 9(2): (2007) |
| 2005 |
|---|
| 16 | | Marcella Anselmo,
Maria Madonia:
Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata .
CIAA 2005: 43-53 |
| 15 |  | Marcella Anselmo,
Maria Madonia:
A Language-Theoretic Approach to Covering Problems.
Journal of Automata, Languages and Combinatorics 10(1): 3-24 (2005) |
| 14 | | 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 |
|---|
| 13 | | Marcella Anselmo,
Dora Giammarresi,
Maria Madonia:
Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet.
Developments in Language Theory 2004: 63-75 |
| 2003 |
|---|
| 12 | | Marcella Anselmo,
Maria Madonia:
Covering Problems from a Formal Language Point of View.
Developments in Language Theory 2003: 122-133 |
| 11 | | Marcella Anselmo:
A non-ambiguous decomposition of regular languages and factorizing codes.
Discrete Applied Mathematics 126(2-3): 129-165 (2003) |
| 2002 |
|---|
| 10 | | Marcella Anselmo,
Dora Giammarresi,
Stefano Varricchio:
Finite Automata and Non-self-Embedding Grammars.
CIAA 2002: 47-56 |
| 2001 |
|---|
| 9 | | Marcella Anselmo:
Constructing Finite Maximal Codes from Schützenberger Conjecture.
ICTCS 2001: 197-214 |
| 1999 |
|---|
| 8 | | Marcella Anselmo:
A non-ambiguous language factorization problem.
Developments in Language Theory 1999: 141-152 |
| 1994 |
|---|
| 7 | | Marcella Anselmo,
Antonio Restivo:
Factorizing Languages.
IFIP Congress (1) 1994: 445-450 |
| 1993 |
|---|
| 6 | | Marcella Anselmo:
The Operation ^ on Formal Series.
Theor. Comput. Sci. 117(1&2): 39-43 (1993) |
| 1991 |
|---|
| 5 | | Marcella Anselmo:
Automates et code zigzag.
ITA 25: 49-66 (1991) |
| 4 | | Marcella Anselmo:
The Zig-Zag Power Series: A Two-Way Version of the * Operator.
Theor. Comput. Sci. 79(1): 3-24 (1991) |
| 1990 |
|---|
| 3 | | Marcella Anselmo:
Two-Way Automata with Multiplicity.
ICALP 1990: 88-102 |
| 2 | | Marcella Anselmo:
Two-Way Reading on Words.
IMYCS 1990: 110-119 |
| 1 | | Marcella Anselmo:
Sur les Codes ZigZag et Leur Décidabilité.
Theor. Comput. Sci. 74(3): 341-354 (1990) |
