Clelia de Felice

J. Autom. Lang. Comb., 2023

2022

Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches.

[BibT_eX]

[DOI]

Inf. Sci., 2022

Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes?

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Hybrid and generalized marked systems.

[BibT_eX]

[DOI]

Rocco Zaccagnino

Theor. Comput. Sci., 2021

On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

2020

Aldo de Luca (1941-2018).

[BibT_eX]

[DOI]

Dominique Perrin

Theor. Comput. Sci., 2020

Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2020

2019

Aldo de Luca (1941 - 2018).

[BibT_eX]

[DOI]

Gabriele Fici

Bull. EATCS, 2019

2018

Inverse Lyndon words and inverse Lyndon factorizations of words.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

2017

Unavoidable sets and circular splicing languages.

[BibT_eX]

[DOI]

Rocco Zaccagnino

Theor. Comput. Sci., 2017

On the decomposition of prefix codes.

[BibT_eX]

[DOI]

Sabrina Mantaci

Theor. Comput. Sci., 2017

Specular sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Splicing music composition.

[BibT_eX]

[DOI]

Inf. Sci., 2017

2016

Some conjectures on codes.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Maximal bifix decoding.

[BibT_eX]

[DOI]

Discret. Math., 2015

Chorale Music Splicing System: An Algorithmic Music Composer Inspired by Molecular Splicing.

[BibT_eX]

[DOI]

Proceedings of the Evolutionary and Biologically Inspired Music, Sound, Art and Design, 2015

2014

Unavoidable Sets and Regularity of Languages Generated by (1, 3)-Circular Splicing Systems.

[BibT_eX]

[DOI]

Rocco Zaccagnino

Proceedings of the Theory and Practice of Natural Computing, 2014

Splicing Systems from Past to Future: Old and New Challenges.

[BibT_eX]

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

Bifix codes and the finite index basis property

[BibT_eX]

[DOI]

CoRR, 2013

Return words in interval exchange transformations

[BibT_eX]

[DOI]

CoRR, 2013

Bifix codes in acyclic sets.

[BibT_eX]

[DOI]

CoRR, 2013

A note on the factorization conjecture.

[BibT_eX]

[DOI]

Acta Informatica, 2013

2012

Recent results on syntactic groups of prefix codes.

[BibT_eX]

[DOI]

Jean Berstel

Dominique Perrin

Eur. J. Comb., 2012

2011

Combinatorics on words.

[BibT_eX]

[DOI]

Arturo Carpi

Theor. Comput. Sci., 2011

2010

A characterization of (regular) circular languages generated by monotone complete splicing systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On the regularity of circular splicing languages: a survey and new developments.

[BibT_eX]

[DOI]

Nat. Comput., 2010

Bifix codes and Sturmian words

[BibT_eX]

[DOI]

Jean Berstel

Dominique Perrin

CoRR, 2010

2009

A characterization of regular circular languages generated by marked splicing systems.

[BibT_eX]

[DOI]

Gabriele Fici

Theor. Comput. Sci., 2009

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

2007

Finite Completions via Factorizing Codes.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2007

On factorizing codes: Structural properties and related decision problems.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2007

Marked Systems and Circular Splicing.

[BibT_eX]

[DOI]

Gabriele Fici

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006

On a complete set of operations for factorizing codes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

Linear splicing and syntactic monoid.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

An enhanced property of factorizing codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The structure of reflexive regular splicing languages via Schützenberger constants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On the power of circular splicing.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages.

[BibT_eX]

[DOI]

Giancarlo Mauri

Proceedings of the New Computational Paradigms, 2005

2004

Circular splicing and regularity.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

2003

Regular Languages Generated by Reflexive Finite Splicing Systems.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002

Decision Problems for Linear and Circular Splicing Systems.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001

On Some Schützenberger Conjectures.

[BibT_eX]

[DOI]

Inf. Comput., 2001

2000

Factorizing Codes and Schützenberger Conjectures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

DNA and Circular Splicing.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000

1999

Hajós Factorizations of Cyclic Groups - A Simpler Proof of a Characterization.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

On the Existence of Codings Between Trace Monoids.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1999

On a Property of the Factorizing Codes.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

1996

An Application of Hajós Factorizations to Variable-Length Codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Any Lifting of a Trace Coding is a Word Coding.

[BibT_eX]

[DOI]

Inf. Comput., 1996

1995

On Some Decision Problems for Trace Codings.

[BibT_eX]

[DOI]

Giovanna Guaiana

Theor. Comput. Sci., 1995

Synchronization and decomposability for a family of codes: Part 2.

[BibT_eX]

[DOI]

Discret. Math., 1995

Coding and Strong Coding in Trace Monoids.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

1994

Coding with Traces.

[BibT_eX]

[DOI]

Giovanna Guaiana

Proceedings of the STACS 94, 1994

1993

A partial result about the factorization conjecture for finite variable-length codes.

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

Synchronization and Decomposability for a Family of Codes.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1992

On the Factorization Conjecture.

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

1991

Degree and Decomposability of Variable-Length Codes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1989

Construction of a Family of Finite Maximal Codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

1988

Finite Biprefix Sets of Paths in a Graph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

On the finite completion of codes.

[BibT_eX]

Bull. EATCS, 1988

1986

Finite Biprefix Sets of Path in a Graph.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

Construction de Codes Factorisants.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Some Results On Finite Maximal Codes.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1985

Construction of a Family of Factorizing Codes.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1982

On the Triangle Conjecture.

[BibT_eX]

[DOI]