| Publication | Date of Publication | Type |
|---|
| On the factorization conjecture | 2022-08-18 | Paper |
| Can formal languages help pangenomics to represent and analyze multiple genomes? | 2022-08-11 | Paper |
| Can we replace reads by numeric signatures? Lyndon fingerprints as representations of sequencing reads for machine learning | 2021-12-21 | Paper |
| Hybrid and generalized marked systems | 2021-11-11 | Paper |
| On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties | 2021-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146649 | 2021-01-26 | Paper |
| Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words | 2020-07-27 | Paper |
| Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages | 2020-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5207880 | 2020-01-13 | Paper |
| Obituary: Aldo de Luca 1941--2018 | 2019-11-07 | Paper |
| Inverse Lyndon words and inverse Lyndon factorizations of words | 2018-10-16 | Paper |
| Coding and strong coding in trace monoids | 2017-12-04 | Paper |
| Specular sets | 2017-06-15 | Paper |
| On the decomposition of prefix codes | 2017-03-16 | Paper |
| Unavoidable sets and circular splicing languages | 2016-12-19 | Paper |
| Acyclic, connected and tree sets | 2015-03-31 | Paper |
| The finite index basis property | 2015-02-27 | Paper |
| Bifix codes and interval exchanges | 2015-02-27 | Paper |
| Maximal bifix decoding | 2015-01-30 | Paper |
| A note on the factorization conjecture | 2014-08-01 | Paper |
| Notes on sets of first return | 2013-08-26 | Paper |
| Bifix codes and Sturmian words | 2013-04-17 | Paper |
| Recent results on syntactic groups of prefix codes. | 2012-08-14 | Paper |
| A characterization of (regular) circular languages generated by monotone complete splicing systems | 2010-11-19 | Paper |
| On the regularity of circular splicing languages: a survey and new developments | 2010-09-16 | Paper |
| On the groups of codes with empty kernel. | 2010-07-06 | Paper |
| A characterization of regular circular languages generated by marked splicing systems | 2009-11-06 | Paper |
| FINITE COMPLETIONS VIA FACTORIZING CODES | 2008-05-14 | Paper |
| Marked Systems and Circular Splicing | 2008-02-26 | Paper |
| On factorizing codes: Structural properties and related decision problems | 2007-06-29 | Paper |
| Linear splicing and syntactic monoid | 2006-04-28 | Paper |
| On a complete set of operations for factorizing codes | 2006-02-22 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| On the power of circular splicing | 2005-09-28 | Paper |
| An enhanced property of factorizing codes | 2005-08-01 | Paper |
| The structure of reflexive regular splicing languages via Schützenberger constants | 2005-06-01 | Paper |
| Circular splicing and regularity | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452057 | 2004-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412101 | 2003-07-13 | Paper |
| On some Schützenberger conjectures | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536365 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529979 | 2002-05-07 | Paper |
| ON A PROPERTY OF THE FACTORIZING CODES | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939574 | 2000-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939576 | 2000-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942647 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227122 | 2000-02-04 | Paper |
| On some factorization problems | 1999-03-14 | Paper |
| Any lifting of a trace coding is a word coding | 1997-04-29 | Paper |
| On some decision problems for trace codings | 1997-02-28 | Paper |
| An application of Hajós factorizations to variable-length codes | 1997-02-27 | Paper |
| Synchronization and decomposability for a family of codes. II | 1996-07-24 | Paper |
| A partial result about the factorization conjecture for finite variable- length codes | 1994-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036595 | 1993-05-18 | Paper |
| SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES | 1993-03-28 | Paper |
| Construction of a family of finite maximal codes | 1989-01-01 | Paper |
| Finite biprefix sets of paths in a graph | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816023 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820022 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3728815 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725767 | 1986-01-01 | Paper |
| Construction de codes factorisants | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3700856 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3748962 | 1985-01-01 | Paper |
| On the triangle conjecture | 1982-01-01 | Paper |
| From the Lyndon factorization to the Canonical Inverse Lyndon factorization: back and forth | 0001-01-03 | Paper |
