| Publication | Date of Publication | Type |
|---|
New string attractor-based complexities for infinite words
Journal of Combinatorial Theory. Series A | 2024-09-30 | Paper |
Unambiguously coded shifts
European Journal of Combinatorics | 2024-06-28 | Paper |
From words to pictures: row-column combinations and Chomsky-Schützenberger theorem
Theoretical Computer Science | 2024-06-03 | Paper |
Decidable problems in substitution shifts
Journal of Computer and System Sciences | 2024-04-09 | Paper |
Recognizability of morphisms
Ergodic Theory and Dynamical Systems | 2023-12-15 | Paper |
A new class of string transformations for compressed text indexing
Information and Computation | 2023-09-27 | Paper |
String attractors and infinite words
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Theoretical Computer Science | 2022-09-27 | Paper |
scientific article; zbMATH DE number 7559170 (Why is no real title available?)
| 2022-07-18 | Paper |
A note on one-sided recognizable morphisms
| 2022-04-08 | Paper |
Reducing local alphabet size in recognizable picture languages
| 2022-03-25 | Paper |
Primitive sets of words
Theoretical Computer Science | 2021-04-14 | Paper |
Unambiguously coded shifts
| 2021-03-01 | Paper |
A combinatorial view on string attractors
Theoretical Computer Science | 2020-12-16 | Paper |
Some Investigations on Similarity Measures Based on Absent Words
Fundamenta Informaticae | 2020-06-21 | Paper |
The alternating BWT: an algorithmic perspective
Theoretical Computer Science | 2020-02-20 | Paper |
scientific article; zbMATH DE number 7150616 (Why is no real title available?)
| 2020-01-13 | Paper |
Obituary: Aldo de Luca 1941--2018
Semigroup Forum | 2019-11-07 | Paper |
On sets of words of rank two
| 2019-11-06 | Paper |
Minimal forbidden factors of circular words
Theoretical Computer Science | 2019-10-07 | Paper |
On generalized Lyndon words
Theoretical Computer Science | 2019-06-18 | Paper |
Some variations on Lyndon words
| 2019-04-01 | Paper |
Block sorting-based transformations on words: beyond the magic BWT
| 2018-11-22 | Paper |
Birecurrent sets
International Journal of Algebra and Computation | 2018-07-12 | Paper |
Anti-powers in infinite words
Journal of Combinatorial Theory. Series A | 2018-04-27 | Paper |
On fixed points of the Burrows-Wheeler transform
Fundamenta Informaticae | 2018-01-19 | Paper |
Anti-powers in infinite words
| 2017-12-19 | Paper |
Minimal forbidden words and symbolic dynamics
STACS 96 | 2017-11-16 | Paper |
Minimal forbidden factors of circular words
Lecture Notes in Computer Science | 2017-11-15 | Paper |
Burrows-Wheeler transform and run-length enconding
| 2017-11-15 | Paper |
Measuring the clustering effect of BWT via RLE
Theoretical Computer Science | 2017-11-06 | Paper |
On the decomposition of prefix codes
Theoretical Computer Science | 2017-03-16 | Paper |
Automata and forbidden words
Information Processing Letters | 2016-06-09 | Paper |
The Shuffle Product: New Research Directions
Language and Automata Theory and Applications | 2016-04-08 | Paper |
Words
| 2015-10-07 | Paper |
Sorting conjugates and suffixes of words in a multiset
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Suffix array and Lyndon factorization of a text
Journal of Discrete Algorithms | 2014-09-05 | Paper |
A new complexity function for words based on periodicity
International Journal of Algebra and Computation | 2013-07-30 | Paper |
Suffixes, conjugates and Lyndon words
Developments in Language Theory | 2013-06-28 | Paper |
Characteristic Sturmian words are extremal for the critical factorization theorem
Theoretical Computer Science | 2012-10-11 | Paper |
Dictionary-symbolwise flexible parsing
Journal of Discrete Algorithms | 2012-09-13 | Paper |
On the product of balanced sequences
RAIRO. Theoretical Informatics and Applications | 2012-08-31 | Paper |
A bijection between words and multisets of necklaces
European Journal of Combinatorics | 2012-08-14 | Paper |
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Theoretical Computer Science | 2012-08-09 | Paper |
Extremal minimality conditions on automata
Theoretical Computer Science | 2012-08-08 | Paper |
On the shuffle of star-free languages
Fundamenta Informaticae | 2012-06-20 | Paper |
A note on Sturmian words
Theoretical Computer Science | 2012-05-30 | Paper |
A graph theoretic approach to automata minimality
Theoretical Computer Science | 2012-05-30 | Paper |
Nondeterministic Moore automata and Brzozowski's algorithm
Implementation and Application of Automata | 2011-07-29 | Paper |
Some remarks on automata minimality
Developments in Language Theory | 2011-07-29 | Paper |
Balancing and clustering of words in the Burrows-Wheeler transform
Theoretical Computer Science | 2011-06-16 | Paper |
Hopcroft's algorithm and tree-like automata
RAIRO - Theoretical Informatics and Applications | 2011-06-10 | Paper |
Dictionary-symbolwise flexible parsing
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Matrix-based complexity functions and recognizable picture languages
| 2011-03-30 | Paper |
Tomographical aspects of L-convex polyominoes
| 2011-02-22 | Paper |
The expressive power of the shuffle product
Information and Computation | 2010-10-22 | Paper |
On extremal cases of Hopcroft's algorithm
Theoretical Computer Science | 2010-10-07 | Paper |
BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS
International Journal of Foundations of Computer Science | 2010-09-06 | Paper |
Automata with Extremal Minimality Conditions
Developments in Language Theory | 2010-08-31 | Paper |
A periodicity theorem on words and applications
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Distance measures for biological sequences: some recent approaches
International Journal of Approximate Reasoning | 2010-03-18 | Paper |
Coding partitions of regular sets
International Journal of Algebra and Computation | 2010-02-19 | Paper |
Circular Sturmian words and Hopcroft's algorithm
Theoretical Computer Science | 2009-10-09 | Paper |
Burrows-Wheeler transform and palindromic richness
Theoretical Computer Science | 2009-08-07 | Paper |
On Extremal Cases of Hopcroft’s Algorithm
Implementation and Application of Automata | 2009-07-09 | Paper |
Balanced Words Having Simple Burrows-Wheeler Transform
Developments in Language Theory | 2009-07-07 | Paper |
Burrows-Wheeler transform and Sturmian words
Information Processing Letters | 2009-03-23 | Paper |
Hopcroft’s Algorithm and Cyclic Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Balance Properties and Distribution of Squares in Circular Words
Developments in Language Theory | 2008-10-30 | Paper |
An automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
RAIRO - Theoretical Informatics and Applications | 2008-09-25 | Paper |
Coding partitions
| 2008-05-27 | Paper |
A new combinatorial approach to sequence comparison
Theory of Computing Systems | 2008-04-11 | Paper |
An extension of the Burrows-Wheeler transform
Theoretical Computer Science | 2007-12-19 | Paper |
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization
Theoretical Computer Science | 2007-12-19 | Paper |
Coding Partitions: Regularity, Maximality and Global Ambiguity
Developments in Language Theory | 2007-11-28 | Paper |
Languages with mismatches
Theoretical Computer Science | 2007-10-18 | Paper |
Varieties of codes and Kraft inequality
Theory of Computing Systems | 2007-08-23 | Paper |
Combinatorial aspects of \(L\)-convex polyominoes
European Journal of Combinatorics | 2007-07-27 | Paper |
Reconstruction of L-convex Polyominoes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Unambiguous recognizable two-dimensional languages
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Higman's theorem on discrete sets
| 2007-01-19 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Word assembly through minimal forbidden words
Theoretical Computer Science | 2006-09-14 | Paper |
A reconstruction algorithm for L-convex polyominoes.
Theoretical Computer Science | 2006-05-18 | Paper |
Enumeration of L-convex polyominoes by rows and columns
Theoretical Computer Science | 2005-12-29 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Discrete Geometry for Computer Imagery
Lecture Notes in Computer Science | 2005-09-13 | Paper |
scientific article; zbMATH DE number 2143013 (Why is no real title available?)
| 2005-03-08 | Paper |
Patterns in words and languages
Discrete Applied Mathematics | 2005-02-23 | Paper |
scientific article; zbMATH DE number 2087238 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087216 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2087492 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2051173 (Why is no real title available?)
| 2004-03-07 | Paper |
scientific article; zbMATH DE number 2011852 (Why is no real title available?)
| 2003-12-02 | Paper |
scientific article; zbMATH DE number 1998341 (Why is no real title available?)
| 2003-10-29 | Paper |
scientific article; zbMATH DE number 1988962 (Why is no real title available?)
| 2003-10-20 | Paper |
Periodicity vectors for labelled trees
Discrete Applied Mathematics | 2003-03-09 | Paper |
On Fine and Wilf's theorem for bidimensional words.
Theoretical Computer Science | 2003-01-22 | Paper |
On the lattice of prefix codes.
Theoretical Computer Science | 2003-01-21 | Paper |
Forbidden Factors and Fragment Assembly
RAIRO - Theoretical Informatics and Applications | 2002-09-18 | Paper |
Words and forbidden factors
Theoretical Computer Science | 2002-07-15 | Paper |
Recurrence and periodicity in infinite words from local periods
Theoretical Computer Science | 2002-03-03 | Paper |
On the defect theorem for trees
Publicationes Mathematicae Debrecen | 2002-02-13 | Paper |
Codes and equations on trees
Theoretical Computer Science | 2001-08-20 | Paper |
Forbidden words in symbolic dynamics
Advances in Applied Mathematics | 2000-11-16 | Paper |
scientific article; zbMATH DE number 1507226 (Why is no real title available?)
| 2000-09-14 | Paper |
scientific article; zbMATH DE number 1414278 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1408358 (Why is no real title available?)
| 2000-02-29 | Paper |
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science | 1999-06-21 | Paper |
On some factorization problems
Bulletin of the Belgian Mathematical Society - Simon Stevin | 1999-03-14 | Paper |
scientific article; zbMATH DE number 1254099 (Why is no real title available?)
| 1999-02-23 | Paper |
Periodicities on trees
Theoretical Computer Science | 1999-01-12 | Paper |
Periodicity and the golden ratio
Theoretical Computer Science | 1999-01-12 | Paper |
scientific article; zbMATH DE number 1222602 (Why is no real title available?)
| 1998-11-11 | Paper |
scientific article; zbMATH DE number 1114046 (Why is no real title available?)
| 1998-02-08 | Paper |
ON LANGUAGES FACTORIZING THE FREE MONOID
International Journal of Algebra and Computation | 1997-03-31 | Paper |
Monadic second-order logic over rectangular pictures and recognizability by tiling systems
Information and Computation | 1996-07-03 | Paper |
scientific article; zbMATH DE number 826075 (Why is no real title available?)
| 1996-06-25 | Paper |
scientific article; zbMATH DE number 871248 (Why is no real title available?)
| 1996-04-28 | Paper |
ON THE STAR HEIGHT OF RATIONAL LANGUAGES
International Journal of Algebra and Computation | 1994-12-11 | Paper |
scientific article; zbMATH DE number 176495 (Why is no real title available?)
| 1993-05-18 | Paper |
Star-free trace languages
Theoretical Computer Science | 1992-09-27 | Paper |
A note on renewal systems
Theoretical Computer Science | 1992-09-26 | Paper |
scientific article; zbMATH DE number 4168387 (Why is no real title available?)
| 1990-01-01 | Paper |
Complete subgraphs of bipartite graphs and applications to trace languages
RAIRO - Theoretical Informatics and Applications | 1990-01-01 | Paper |
Codes and local constraints
Theoretical Computer Science | 1990-01-01 | Paper |
A note on multiset decipherable codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Completing codes
RAIRO - Theoretical Informatics and Applications | 1989-01-01 | Paper |
Permutation properties and the Fibonacci semigroup
Semigroup Forum | 1989-01-01 | Paper |
Finitely generated sofic systems
Theoretical Computer Science | 1989-01-01 | Paper |
Star-free sets of integers
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3976386 (Why is no real title available?)
| 1985-01-01 | Paper |
Rational languages and the Burnside problem
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3912631 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3926268 (Why is no real title available?)
| 1985-01-01 | Paper |
On cancellation properties of languages which are supports of rational power series
Journal of Computer and System Sciences | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3926266 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3936540 (Why is no real title available?)
| 1984-01-01 | Paper |
A finiteness condition for finitely generated semigroups
Semigroup Forum | 1984-01-01 | Paper |
On the Burnside problem for semigroups
Journal of Algebra | 1984-01-01 | Paper |
On the centers of a language
Theoretical Computer Science | 1983-01-01 | Paper |
Some applications of a theorem of Shirshov to language theory
Information and Control | 1983-01-01 | Paper |
A family of codes commutatively equivalent to prefix codes
Information Processing Letters | 1981-01-01 | Paper |
A synchronization property of pure subsemigroups of a free semigroup
Semigroup Forum | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3817996 (Why is no real title available?)
| 1981-01-01 | Paper |
scientific article; zbMATH DE number 3707791 (Why is no real title available?)
| 1980-01-01 | Paper |
Minimal complete sets of words
Theoretical Computer Science | 1980-01-01 | Paper |
On some properties of very pure codes
Theoretical Computer Science | 1980-01-01 | Paper |
A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
Information and Control | 1980-01-01 | Paper |
Sur le théorème du defaut
Journal of Algebra | 1979-01-01 | Paper |
Synchronization and simplification
Discrete Mathematics | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3638132 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3595429 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3745508 (Why is no real title available?)
| 1978-01-01 | Paper |
scientific article; zbMATH DE number 3578341 (Why is no real title available?)
| 1977-01-01 | Paper |
scientific article; zbMATH DE number 3578342 (Why is no real title available?)
| 1977-01-01 | Paper |
On codes having no finite completions
Discrete Mathematics | 1977-01-01 | Paper |
scientific article; zbMATH DE number 3606368 (Why is no real title available?)
| 1976-01-01 | Paper |
A combinatorial property of codes having finite synchronization delay
Theoretical Computer Science | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3540385 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3535141 (Why is no real title available?)
| 1974-01-01 | Paper |
On a question of McNaughton and Papert
Information and Control | 1974-01-01 | Paper |
scientific article; zbMATH DE number 3436628 (Why is no real title available?)
| 1973-01-01 | Paper |
On the mathematical description of quantized fields
Communications in Mathematical Physics | 1970-01-01 | Paper |
