| Publication | Date of Publication | Type |
|---|
Topologies for error-detecting variable-length codes
Information and Computation | 2024-02-02 | Paper |
Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
Theoretical Computer Science | 2023-10-17 | Paper |
When variable-length codes meet the field of error detection
Algebraic Informatics | 2023-07-26 | Paper |
Gray cycles of maximum length related to \(k\)-character substitutions
(available as arXiv preprint) | 2022-11-09 | Paper |
Variable-length codes independent or closed with respect to edit relations
Information and Computation | 2022-10-13 | Paper |
Complete variable-length codes: an excursion into word edit operations
(available as arXiv preprint) | 2020-07-27 | Paper |
Embedding a \(\theta \)-invariant code into a complete one
Theoretical Computer Science | 2020-01-16 | Paper |
| Conferences WORDS, years 1997--2017: open problems and conjectures | 2019-12-09 | Paper |
Invariance: a theoretical approach for coding sets of words modulo literal (anti)morphisms
(available as arXiv preprint) | 2017-11-15 | Paper |
| Ten Conferences WORDS: Open Problems and Conjectures | 2017-05-11 | Paper |
A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
International Journal of Foundations of Computer Science | 2015-12-11 | Paper |
On the contribution of WORDS to the field of combinatorics on words
Lecture Notes in Computer Science | 2015-11-04 | Paper |
A generalization of Girod's bidirectional decoding method to codes with a finite deciphering delay
Developments in Language Theory | 2012-11-02 | Paper |
Completing circular codes in regular submonoids
Theoretical Computer Science | 2008-03-05 | Paper |
| scientific article; zbMATH DE number 5117090 (Why is no real title available?) | 2007-01-19 | Paper |
Completing prefix codes in submonoids.
Theoretical Computer Science | 2006-05-18 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
| scientific article; zbMATH DE number 2143015 (Why is no real title available?) | 2005-03-08 | Paper |
FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
International Journal of Algebra and Computation | 2004-05-27 | Paper |
Locally complete sets and finite decomposable codes
Theoretical Computer Science | 2002-07-15 | Paper |
On codes with a finite deciphering delay: Constructing uncompletable words
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1346503 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1346508 (Why is no real title available?) | 1999-10-03 | Paper |
Detecting the morphic images of a word : improving the general algorithm
RAIRO - Theoretical Informatics and Applications | 1997-12-14 | Paper |
Algorithms for detecting morphic images of a word
Information and Computation | 1996-04-16 | Paper |
Detecting morphic images of a word: On the rank of a pattern
Acta Informatica | 1995-11-09 | Paper |
Equations in words: An algorithmic contribution
Bulletin of the Belgian Mathematical Society - Simon Stevin | 1994-06-15 | Paper |
Deciding whether a finite set of words has rank at most two
Theoretical Computer Science | 1993-05-24 | Paper |
| scientific article; zbMATH DE number 125885 (Why is no real title available?) | 1993-02-21 | Paper |
On the rank of the subsets of a free monoid
Theoretical Computer Science | 1992-09-27 | Paper |
A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)
Theoretical Computer Science | 1992-09-26 | Paper |
Elementariness of a finite set of words is co-NP-complete
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
On the deficit of a finite set of words
Semigroup Forum | 1990-01-01 | Paper |
