The following pages link to Clelia De Felice (Q243830):
Displayed 50 items.
- Recent results on syntactic groups of prefix codes. (Q444391) (← links)
- On the decomposition of prefix codes (Q517038) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- An application of Hajós factorizations to variable-length codes (Q671432) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Any lifting of a trace coding is a word coding (Q675053) (← links)
- Unavoidable sets and circular splicing languages (Q728277) (← links)
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words (Q782596) (← links)
- On the groups of codes with empty kernel. (Q982209) (← links)
- (Q1034614) (redirect page) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- Construction de codes factorisants (Q1081306) (← links)
- Finite biprefix sets of paths in a graph (Q1105386) (← links)
- Construction of a family of finite maximal codes (Q1117704) (← links)
- On the triangle conjecture (Q1165589) (← links)
- On some factorization problems (Q1280223) (← links)
- A partial result about the factorization conjecture for finite variable- length codes (Q1313854) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- On some Schützenberger conjectures (Q1854441) (← links)
- Synchronization and decomposability for a family of codes. II (Q1893165) (← links)
- Bifix codes and Sturmian words (Q1946105) (← links)
- On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
- Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning (Q2061990) (← links)
- Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- The finite index basis property (Q2259171) (← links)
- Bifix codes and interval exchanges (Q2259187) (← links)
- Obituary: Aldo de Luca 1941--2018 (Q2334412) (← links)
- Acyclic, connected and tree sets (Q2339363) (← links)
- Specular sets (Q2358694) (← links)
- On factorizing codes: Structural properties and related decision problems (Q2370827) (← links)
- An enhanced property of factorizing codes (Q2484437) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- A note on the factorization conjecture (Q2510385) (← links)
- Maximal bifix decoding (Q2514159) (← links)
- On the power of circular splicing (Q2565850) (← links)
- On a complete set of operations for factorizing codes (Q3374755) (← links)
- (Q3700856) (← links)
- (Q3728815) (← links)
- (Q3748962) (← links)
- (Q3816023) (← links)
- (Q3820022) (← links)
- SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES (Q4029499) (← links)
- (Q4036595) (← links)
- (Q4227122) (← links)
- (Q4412101) (← links)
- (Q4452057) (← links)
- ON A PROPERTY OF THE FACTORIZING CODES (Q4513297) (← links)
- (Q4529979) (← links)