default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcella Anselmo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c33]Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Sets of Words and Generalizations of the Fibonacci Cubes. CiE 2024: 447-460- [i4]Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Characterization of Isometric Words based on Swap and Mismatch Distance. CoRR abs/2404.13577 (2024) - 2023
- [c32]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores
, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Hypercubes and Isometric Words Based on Swap and Mismatch Distance. DCFS 2023: 21-35 - [c31]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Words Based on Swap and Mismatch Distance. DLT 2023: 23-35 - [c30]Marcella Anselmo, Manuela Flores, Maria Madonia:
Density of Ham- and Lee- non-isometric k-ary Words. ICTCS 2023: 116-128 - [i3]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Isometric Words based on Swap and Mismatch Distance. CoRR abs/2303.03086 (2023) - [i2]Marcella Anselmo, Giuseppa Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci:
Hypercubes and Isometric Words based on Swap and Mismatch Distance. CoRR abs/2303.09898 (2023) - 2022
- [j26]Marcella Anselmo, Manuela Flores, Maria Madonia:
On k-ary n-cubes and isometric words. Theor. Comput. Sci. 938: 50-64 (2022) - [c29]Marcella Anselmo, Manuela Flores, Maria Madonia:
Fun Slot Machines and Transformations of Words Avoiding Factors. FUN 2022: 4:1-4:15 - 2021
- [c28]Marcella Anselmo, Manuela Flores, Maria Madonia:
Quaternary n-cubes and Isometric Words. WORDS 2021: 27-39 - 2020
- [j25]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
A Common Framework to Recognize Two-dimensional Languages. Fundam. Informaticae 171(1-4): 1-17 (2020) - [j24]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Characterization and measure of infinite two-dimensional strong prefix codes. Inf. Comput. 274: 104536 (2020) - [c27]Marcella Anselmo, Dora Giammarresi, Maria Madonia, Carla Selmi:
Bad Pictures: Some Structural Properties Related to Overlaps. DCFS 2020: 13-25 - [e1]Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly:
Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings. Lecture Notes in Computer Science 12098, Springer 2020, ISBN 978-3-030-51465-5 [contents]
2010 – 2019
- 2019
- [j23]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Sets of Pictures Avoiding Overlaps. Int. J. Found. Comput. Sci. 30(6-7): 875-898 (2019) - [j22]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Full sets of pictures to encode pictures. Theor. Comput. Sci. 777: 55-68 (2019) - [c26]Marcella Anselmo, Maria Madonia, Carla Selmi:
Toroidal Codes and Conjugate Pictures. LATA 2019: 288-301 - 2018
- [c25]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Encoding Pictures with Maximal Codes of Pictures. SOFSEM 2018: 552-565 - 2017
- [j21]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Picture codes and deciphering delay. Inf. Comput. 253: 358-370 (2017) - [j20]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Structure and properties of strong prefix codes of pictures. Math. Struct. Comput. Sci. 27(2): 123-142 (2017) - [j19]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Non-expandable non-overlapping sets of pictures. Theor. Comput. Sci. 657: 127-136 (2017) - [j18]Marcella Anselmo, Maria Madonia:
Two-dimensional comma-free and cylindric codes. Theor. Comput. Sci. 658: 4-17 (2017) - [c24]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties. AUTOMATA 2017: 19-31 - [c23]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Avoiding Overlaps in Pictures. DCFS 2017: 16-32 - 2016
- [i1]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Construction of Non-expandable Non-overlapping Sets of Pictures. CoRR abs/1605.09061 (2016) - 2015
- [c22]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Unbordered Pictures: Properties and Construction. CAI 2015: 45-57 - [c21]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Structure and Measure of a Decidable Class of Two-dimensional Codes. LATA 2015: 315-327 - 2014
- [j17]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Prefix Picture codes: a Decidable class of Two-Dimensional codes. Int. J. Found. Comput. Sci. 25(8): 1017-1032 (2014) - [c20]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Picture Codes with Finite Deciphering Delay. LATA 2014: 88-100 - 2013
- [j16]Marcella Anselmo, Maria Madonia:
A Stronger Recognizability Condition for Two-dimensional Languages. Discret. Math. Theor. Comput. Sci. 15(2): 139-156 (2013) - [c19]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Strong Prefix Codes of Pictures. CAI 2013: 47-59 - [c18]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Two Dimensional Prefix Codes of Pictures. Developments in Language Theory 2013: 46-57 - [c17]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory. SOFSEM 2013: 133-145 - 2011
- [j15]Marcella Anselmo, Maria Madonia:
Some results on the structure of unary unambiguous automata. Adv. Appl. Math. 47(1): 88-101 (2011) - [c16]Marcella Anselmo, Maria Madonia:
Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages. CAI 2011: 84-96 - [c15]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Classification of String Languages via Tiling Recognizable Picture Languages. LATA 2011: 105-116 - 2010
- [j14]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages. Fundam. Informaticae 98(2-3): 143-166 (2010) - [j13]Marcella Anselmo, Maria Madonia:
Classes of two-dimensional languages and recognizability conditions. RAIRO Theor. Informatics Appl. 44(4): 471-488 (2010)
2000 – 2009
- 2009
- [j12]Marcella Anselmo, Maria Madonia:
Deterministic and unambiguous two-dimensional languages over one-letter alphabet. Theor. Comput. Sci. 410(16): 1477-1485 (2009) - [j11]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
A computational model for tiling recognizable two-dimensional languages. Theor. Comput. Sci. 410(37): 3520-3529 (2009) - [c14]Marcella Anselmo, Maria Madonia:
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages. CAI 2009: 147-159 - [c13]Marcella Anselmo, Natasha Jonoska, Maria Madonia:
Framed Versus Unframed Two-Dimensional Languages. SOFSEM 2009: 79-92 - 2007
- [j10]Marcella Anselmo, Alessandra Cherubini, Pierluigi San Pietro:
Regular Languages and Associative Language Descriptions. Discret. Math. Theor. Comput. Sci. 9(2) (2007) - [c12]Marcella Anselmo, Maria Madonia:
Deterministic Two-Dimensional Languages over One-Letter Alphabet. CAI 2007: 147-159 - [c11]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
From Determinism to Non-determinism in Recognizable Two-Dimensional Languages. Developments in Language Theory 2007: 36-47 - [c10]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages. CIAA 2007: 290-302 - 2006
- [j9]Marcella Anselmo, Dora Giammarresi, Maria Madonia, Antonio Restivo:
Unambiguous recognizable two-dimensional languages. RAIRO Theor. Informatics Appl. 40(2): 277-293 (2006) - 2005
- [j8]Marcella Anselmo, Maria Madonia:
A Language-Theoretic Approach to Covering Problems. J. Autom. Lang. Comb. 10(1): 3-24 (2005) - [j7]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) - [c9]Marcella Anselmo, Maria Madonia:
Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata . CIAA 2005: 43-53 - 2004
- [c8]Marcella Anselmo, Dora Giammarresi, Maria Madonia:
Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet. Developments in Language Theory 2004: 63-75 - 2003
- [j6]Marcella Anselmo:
A non-ambiguous decomposition of regular languages and factorizing codes. Discret. Appl. Math. 126(2-3): 129-165 (2003) - [c7]Marcella Anselmo, Maria Madonia:
Covering Problems from a Formal Language Point of View. Developments in Language Theory 2003: 122-133 - 2002
- [c6]Marcella Anselmo, Dora Giammarresi, Stefano Varricchio:
Finite Automata and Non-self-Embedding Grammars. CIAA 2002: 47-56 - 2001
- [c5]Marcella Anselmo:
Constructing Finite Maximal Codes from Schützenberger Conjecture. ICTCS 2001: 197-214
1990 – 1999
- 1999
- [c4]Marcella Anselmo:
A non-ambiguous language factorization problem. Developments in Language Theory 1999: 141-152 - 1996
- [j5]Marcella Anselmo, Antonio Restivo:
On Languages Factorizing the Free Monoid. Int. J. Algebra Comput. 6(4): 413-428 (1996) - 1994
- [c3]Marcella Anselmo, Antonio Restivo:
Factorizing Languages. IFIP Congress (1) 1994: 445-450 - 1993
- [j4]Marcella Anselmo:
The Operation ^ on Formal Series. Theor. Comput. Sci. 117(1&2): 39-43 (1993) - 1991
- [j3]Marcella Anselmo:
Automates et code zigzag. RAIRO Theor. Informatics Appl. 25: 49-66 (1991) - [j2]Marcella Anselmo:
The Zig-Zag Power Series: A Two-Way Version of the * Operator. Theor. Comput. Sci. 79(1): 3-24 (1991) - 1990
- [j1]Marcella Anselmo:
Sur les Codes ZigZag et Leur Décidabilité. Theor. Comput. Sci. 74(3): 341-354 (1990) - [c2]Marcella Anselmo:
Two-Way Automata with Multiplicity. ICALP 1990: 88-102 - [c1]Marcella Anselmo:
Two-Way Reading on Words. IMYCS 1990: 110-119
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-21 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
