The following pages link to Rosalba Zizza (Q243832):
Displayed 25 items.
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- Unavoidable sets and circular splicing languages (Q728277) (← links)
- Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words (Q782596) (← links)
- Testing DNA code words properties of regular languages (Q896711) (← links)
- A characterization of regular circular languages generated by marked splicing systems (Q1034615) (← links)
- (Q1603388) (redirect page) (← links)
- Separating some splicing models. (Q1603389) (← 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 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)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- On the power of circular splicing (Q2565850) (← links)
- (Q4412101) (← links)
- (Q4452057) (← links)
- (Q4453467) (← links)
- (Q4529979) (← links)
- An Easy Automata Based Algorithm for Testing Coding Properties of Infinite Sets of (DNA) Words (Q4649276) (← links)
- Circular splicing and regularity (Q4825394) (← links)
- Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages (Q5114209) (← links)
- (Q5146649) (← links)
- Marked Systems and Circular Splicing (Q5444964) (← links)
- On the regularity of circular splicing languages: a survey and new developments (Q5962067) (← links)