| Publication | Date of Publication | Type |
|---|
Isometric words and edit distance: main notions and new variations
| 2024-05-29 | Paper |
Isometric words based on swap and mismatch distance
Developments in Language Theory | 2023-11-16 | Paper |
Hypercubes and isometric words based on swap and mismatch distance
Descriptional Complexity of Formal Systems | 2023-08-17 | Paper |
The intersection of \(3\)-maximal submonoids
Theoretical Computer Science | 2022-01-18 | Paper |
Primitive sets of words
Theoretical Computer Science | 2021-04-14 | Paper |
The Intersection of $3$-Maximal Submonids
| 2020-08-04 | Paper |
Some Investigations on Similarity Measures Based on Absent Words
Fundamenta Informaticae | 2020-06-21 | Paper |
On sets of words of rank two
| 2019-11-06 | Paper |
On the exhaustive generation of \(k\)-convex polyominoes
Theoretical Computer Science | 2017-03-16 | Paper |
On a class of languages with holonomic generating functions
Theoretical Computer Science | 2016-12-19 | Paper |
Standard Sturmian words and automata minimization algorithms
Theoretical Computer Science | 2015-09-16 | Paper |
Epichristoffel Words and Minimization of Moore Automata
Fundamenta Informaticae | 2015-06-26 | Paper |
An efficient algorithm for the generation of Z-convex polyominoes
Lecture Notes in Computer Science | 2015-04-17 | Paper |
On computing the degree of convexity of polyominoes
The Electronic Journal of Combinatorics | 2015-01-22 | Paper |
Words, trees and automata minimization
Lecture Notes in Computer Science | 2013-09-20 | Paper |
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Theoretical Computer Science | 2012-08-09 | Paper |
On the shuffle of star-free languages
Fundamenta Informaticae | 2012-06-20 | Paper |
Nondeterministic Moore automata and Brzozowski's algorithm
Implementation and Application of Automata | 2011-07-29 | Paper |
Hopcroft's algorithm and tree-like automata
RAIRO - Theoretical Informatics and Applications | 2011-06-10 | Paper |
Tomographical aspects of L-convex polyominoes
| 2011-02-22 | Paper |
A challenging family of automata for classical minimization algorithms
Implementation and Application of Automata | 2011-02-11 | Paper |
On extremal cases of Hopcroft's algorithm
Theoretical Computer Science | 2010-10-07 | Paper |
Circular Sturmian words and Hopcroft's algorithm
Theoretical Computer Science | 2009-10-09 | Paper |
On Extremal Cases of Hopcroft’s Algorithm
Implementation and Application of Automata | 2009-07-09 | Paper |
Hopcroft’s Algorithm and Cyclic Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Recognizable Picture Languages and Polyominoes
Algebraic Informatics | 2008-09-04 | 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 |
Higman's theorem on discrete sets
| 2007-01-19 | 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 |
Machines, Computations, and Universality
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Discrete Geometry for Computer Imagery
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Patterns in words and languages
Discrete Applied Mathematics | 2005-02-23 | Paper |
