
Matching Patterns with Variables under Hamming Distance
A pattern α is a string of variables and terminal letters. We say that α...
read it

Efficiently Testing Simon's Congruence
Simon's congruence ∼_k is defined as follows: two words are ∼_kequivale...
read it

Reconstructing Words from RightBoundedBlock Words
A reconstruction problem of words from scattered factors asks for the mi...
read it

Matching Patterns with Variables
A pattern p (i.e., a string of variables and terminals) matches a word w...
read it

On Modelling the Avoidability of Patterns as CSP
Solving avoidability problems in the area of string combinatorics often ...
read it

Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
We investigate the locality number, a recently introduced structural par...
read it

Fast and Longest Rollercoasters
For k≥ 3, a krollercoaster is a sequence of numbers whose every maximal...
read it

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability
The study of word equations (or the existential theory of equations over...
read it

Rollercoasters and Caterpillars
A rollercoaster is a sequence of real numbers for which every maximal co...
read it
Florin Manea
is this you? claim profile