Clelia de Felice

According to our database1, Clelia de Felice
  • authored at least 62 papers between 1982 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Unavoidable sets and circular splicing languages.
Theor. Comput. Sci., 2017

On the decomposition of prefix codes.
Theor. Comput. Sci., 2017

Specular sets.
Theor. Comput. Sci., 2017

Splicing music composition.
Inf. Sci., 2017

Inverse Lyndon words and Inverse Lyndon factorizations of words.
CoRR, 2017

2016
Some conjectures on codes.
CoRR, 2016

2015
Maximal bifix decoding.
Discrete Mathematics, 2015

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

Specular sets.
CoRR, 2015

Chorale Music Splicing System: An Algorithmic Music Composer Inspired by Molecular Splicing.
Proceedings of the Evolutionary and Biologically Inspired Music, Sound, Art and Design, 2015

Specular Sets.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
Unavoidable Sets and Regularity of Languages Generated by (1, 3)-Circular Splicing Systems.
Proceedings of the Theory and Practice of Natural Computing, 2014

Splicing Systems from Past to Future: Old and New Challenges.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Bifix codes and the finite index basis property
CoRR, 2013

Return words in interval exchange transformations
CoRR, 2013

Bifix codes in acyclic sets.
CoRR, 2013

A note on the factorization conjecture.
Acta Inf., 2013

2012
Recent results on syntactic groups of prefix codes.
Eur. J. Comb., 2012

A note on the factorization conjecture
CoRR, 2012

2011
Combinatorics on words.
Theor. Comput. Sci., 2011

2010
A characterization of (regular) circular languages generated by monotone complete splicing systems.
Theor. Comput. Sci., 2010

On the regularity of circular splicing languages: a survey and new developments.
Natural Computing, 2010

Bifix codes and Sturmian words
CoRR, 2010

2009
A characterization of regular circular languages generated by marked splicing systems.
Theor. Comput. Sci., 2009

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages
Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009

2007
Finite Completions via Factorizing Codes.
IJAC, 2007

Marked Systems and Circular Splicing.
Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

2006
On a complete set of operations for factorizing codes.
ITA, 2006

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

Linear splicing and syntactic monoid.
Discrete Applied Mathematics, 2006

2005
An enhanced property of factorizing codes.
Theor. Comput. Sci., 2005

The structure of reflexive regular splicing languages via Schützenberger constants.
Theor. Comput. Sci., 2005

On the power of circular splicing.
Discrete Applied Mathematics, 2005

Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages.
Proceedings of the New Computational Paradigms, 2005

2004
Circular splicing and regularity.
ITA, 2004

2003
Regular Languages Generated by Reflexive Finite Splicing Systems.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Decision Problems for Linear and Circular Splicing Systems.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
On Some Schützenberger Conjectures.
Inf. Comput., 2001

2000
Factorizing Codes and Schützenberger Conjectures.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

DNA and Circular Splicing.
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.
Journal of Automata, Languages and Combinatorics, 1999

On the Existence of Codings Between Trace Monoids.
Journal of Automata, Languages and Combinatorics, 1999

On a Property of the Factorizing Codes.
IJAC, 1999

1996
An Application of Hajós Factorizations to Variable-Length Codes.
Theor. Comput. Sci., 1996

Any Lifting of a Trace Coding is a Word Coding.
Inf. Comput., 1996

1995
On Some Decision Problems for Trace Codings.
Theor. Comput. Sci., 1995

Synchronization and decomposability for a family of codes: Part 2.
Discrete Mathematics, 1995

Coding and Strong Coding in Trace Monoids.
STACS, 1995

1994
Coding with Traces.
Proceedings of the STACS 94, 1994

1993
A partial result about the factorization conjecture for finite variable-length codes.
Discrete Mathematics, 1993

1992
Synchronization and Decomposability for a Family of Codes.
IJAC, 1992

On the Factorization Conjecture.
Proceedings of the STACS 92, 1992

1991
Degree and Decomposability of Variable-Length Codes.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1989
Construction of a Family of Finite Maximal Codes.
Theor. Comput. Sci., 1989

1988
Finite Biprefix Sets of Paths in a Graph.
Theor. Comput. Sci., 1988

On the finite completion of codes.
Bulletin of the EATCS, 1988

Construction of a Family of Finite Maximal Codes.
Proceedings of the STACS 88, 1988

1986
Finite Biprefix Sets of Path in a Graph.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985
Construction de Codes Factorisants.
Theor. Comput. Sci., 1985

Some Results On Finite Maximal Codes.
ITA, 1985

Construction of a Family of Factorizing Codes.
Proceedings of the STACS 85, 1985

1982
On the Triangle Conjecture.
Inf. Process. Lett., 1982


  Loading...