Clelia De Felice

From MaRDI portal
Revision as of 18:26, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Clelia De Felice to Clelia De Felice: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:243830

Available identifiers

zbMath Open de-felice.cleliaDBLPf/CleliadeFeliceWikidataQ62050900 ScholiaQ62050900MaRDI QIDQ243830

List of research outcomes

PublicationDate of PublicationType
On the factorization conjecture2022-08-18Paper
Can formal languages help pangenomics to represent and analyze multiple genomes?2022-08-11Paper
Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning2021-12-21Paper
Hybrid and generalized marked systems2021-11-11Paper
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties2021-03-09Paper
https://portal.mardi4nfdi.de/entity/Q51466492021-01-26Paper
Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words2020-07-27Paper
Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages2020-06-21Paper
https://portal.mardi4nfdi.de/entity/Q52078802020-01-13Paper
Obituary: Aldo de Luca 1941--20182019-11-07Paper
Inverse Lyndon words and inverse Lyndon factorizations of words2018-10-16Paper
Coding and strong coding in trace monoids2017-12-04Paper
Specular sets2017-06-15Paper
On the decomposition of prefix codes2017-03-16Paper
Unavoidable sets and circular splicing languages2016-12-19Paper
Acyclic, connected and tree sets2015-03-31Paper
The finite index basis property2015-02-27Paper
Bifix codes and interval exchanges2015-02-27Paper
Maximal bifix decoding2015-01-30Paper
A note on the factorization conjecture2014-08-01Paper
Notes on sets of first return2013-08-26Paper
Bifix codes and Sturmian words2013-04-17Paper
Recent results on syntactic groups of prefix codes.2012-08-14Paper
A characterization of (regular) circular languages generated by monotone complete splicing systems2010-11-19Paper
On the regularity of circular splicing languages: a survey and new developments2010-09-16Paper
On the groups of codes with empty kernel.2010-07-06Paper
A characterization of regular circular languages generated by marked splicing systems2009-11-06Paper
FINITE COMPLETIONS VIA FACTORIZING CODES2008-05-14Paper
Marked Systems and Circular Splicing2008-02-26Paper
On factorizing codes: Structural properties and related decision problems2007-06-29Paper
Linear splicing and syntactic monoid2006-04-28Paper
On a complete set of operations for factorizing codes2006-02-22Paper
New Computational Paradigms2006-01-11Paper
On the power of circular splicing2005-09-28Paper
An enhanced property of factorizing codes2005-08-01Paper
The structure of reflexive regular splicing languages via Schützenberger constants2005-06-01Paper
Circular splicing and regularity2004-10-28Paper
https://portal.mardi4nfdi.de/entity/Q44520572004-02-11Paper
https://portal.mardi4nfdi.de/entity/Q44121012003-07-13Paper
On some Schützenberger conjectures2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45363652002-11-04Paper
https://portal.mardi4nfdi.de/entity/Q45299792002-05-07Paper
ON A PROPERTY OF THE FACTORIZING CODES2000-11-07Paper
https://portal.mardi4nfdi.de/entity/Q49395742000-06-13Paper
https://portal.mardi4nfdi.de/entity/Q49395762000-03-20Paper
https://portal.mardi4nfdi.de/entity/Q49426472000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42271222000-02-04Paper
On some factorization problems1999-03-14Paper
Any lifting of a trace coding is a word coding1997-04-29Paper
On some decision problems for trace codings1997-02-28Paper
An application of Hajós factorizations to variable-length codes1997-02-27Paper
Synchronization and decomposability for a family of codes. II1996-07-24Paper
A partial result about the factorization conjecture for finite variable- length codes1994-03-01Paper
https://portal.mardi4nfdi.de/entity/Q40365951993-05-18Paper
SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES1993-03-28Paper
Construction of a family of finite maximal codes1989-01-01Paper
Finite biprefix sets of paths in a graph1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38160231988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38200221988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37288151986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47257671986-01-01Paper
Construction de codes factorisants1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37008561985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37489621985-01-01Paper
On the triangle conjecture1982-01-01Paper
From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Clelia De Felice