Marcella Anselmo

According to our database1, Marcella Anselmo authored at least 61 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Characterization of Isometric Words based on Swap and Mismatch Distance.
CoRR, 2024

Isometric Sets of Words and Generalizations of the Fibonacci Cubes.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
Density of Ham- and Lee- non-isometric k-ary Words.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Hypercubes and Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022
On <i>k</i>-ary <i>n</i>-cubes and isometric words.
Theor. Comput. Sci., 2022

Fun Slot Machines and Transformations of Words Avoiding Factors.
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021
Quaternary n-cubes and Isometric Words.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020
Characterization and measure of infinite two-dimensional strong prefix codes.
Inf. Comput., 2020

A Common Framework to Recognize Two-dimensional Languages.
Fundam. Informaticae, 2020

Bad Pictures: Some Structural Properties Related to Overlaps.
Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019
Full sets of pictures to encode pictures.
Theor. Comput. Sci., 2019

Sets of Pictures Avoiding Overlaps.
Int. J. Found. Comput. Sci., 2019

Toroidal Codes and Conjugate Pictures.
Proceedings of the Language and Automata Theory and Applications, 2019

2018
Encoding Pictures with Maximal Codes of Pictures.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

2017
Two-dimensional comma-free and cylindric codes.
Theor. Comput. Sci., 2017

Non-expandable non-overlapping sets of pictures.
Theor. Comput. Sci., 2017

Structure and properties of strong prefix codes of pictures.
Math. Struct. Comput. Sci., 2017

Picture codes and deciphering delay.
Inf. Comput., 2017

Avoiding Overlaps in Pictures.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016
Construction of Non-expandable Non-overlapping Sets of Pictures.
CoRR, 2016

2015
Structure and Measure of a Decidable Class of Two-dimensional Codes.
Proceedings of the Language and Automata Theory and Applications, 2015

Unbordered Pictures: Properties and Construction.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
Prefix Picture codes: a Decidable class of Two-Dimensional codes.
Int. J. Found. Comput. Sci., 2014

Picture Codes with Finite Deciphering Delay.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
A Stronger Recognizability Condition for Two-dimensional Languages.
Discret. Math. Theor. Comput. Sci., 2013

Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory.
Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Two Dimensional Prefix Codes of Pictures.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Strong Prefix Codes of Pictures.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2011
Some results on the structure of unary unambiguous automata.
Adv. Appl. Math., 2011

Classification of String Languages via Tiling Recognizable Picture Languages.
Proceedings of the Language and Automata Theory and Applications, 2011

Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages.
Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010
Classes of two-dimensional languages and recognizability conditions.
RAIRO Theor. Informatics Appl., 2010

Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages.
Fundam. Informaticae, 2010

2009
Deterministic and unambiguous two-dimensional languages over one-letter alphabet.
Theor. Comput. Sci., 2009

A computational model for tiling recognizable two-dimensional languages.
Theor. Comput. Sci., 2009

Framed Versus Unframed Two-Dimensional Languages.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2007
Regular Languages and Associative Language Descriptions.
Discret. Math. Theor. Comput. Sci., 2007

Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.
Proceedings of the Implementation and Application of Automata, 2007

From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Deterministic Two-Dimensional Languages over One-Letter Alphabet.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Unambiguous recognizable two-dimensional languages.
RAIRO Theor. Informatics Appl., 2006

2005
New operations and regular expressions for two-dimensional languages over one-letter alphabet.
Theor. Comput. Sci., 2005

A Language-Theoretic Approach to Covering Problems.
J. Autom. Lang. Comb., 2005

Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata .
Proceedings of the Implementation and Application of Automata, 2005

2004
Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet.
Proceedings of the Developments in Language Theory, 2004

2003
A non-ambiguous decomposition of regular languages and factorizing codes.
Discret. Appl. Math., 2003

Covering Problems from a Formal Language Point of View.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Finite Automata and Non-self-Embedding Grammars.
Proceedings of the Implementation and Application of Automata, 2002

2001
Constructing Finite Maximal Codes from Schützenberger Conjecture.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

1999
A non-ambiguous language factorization problem.
Proceedings of the Developments in Language Theory, 1999

1996
On Languages Factorizing the Free Monoid.
Int. J. Algebra Comput., 1996

1994
Factorizing Languages.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
The Operation ^ on Formal Series.
Theor. Comput. Sci., 1993

1991
The Zig-Zag Power Series: A Two-Way Version of the * Operator.
Theor. Comput. Sci., 1991

Automates et code zigzag.
RAIRO Theor. Informatics Appl., 1991

1990
Sur les Codes ZigZag et Leur Décidabilité.
Theor. Comput. Sci., 1990

Two-Way Reading on Words.
Proceedings of the Aspects and Prospects of Theoretical Computer Science, 1990

Two-Way Automata with Multiplicity.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990


  Loading...