Matching Patterns with Variables Under Simon’s Congruence | SpringerLink Skip to main
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track …

The Simon's congruence problem is to determine whether or not two strings have the same
set of subsequences of length no greater than a given integer, and the problem can be …

In this paper, we study a series of algorithmic problems related to the subsequences
occurring in the strings of a given language, under the assumption that this language is …

We study the problem of deciding whether a given language is directed. A language $ L $
is\emph {directed} if every pair of words in $ L $ have a common (scattered) superword in …

For two strings u, v over some alphabet A, we investigate the problem of embedding u into w
as a subsequence under the presence of generalised gap constraints. A generalised gap …

A subsequence of a word $ w $ is a word $ u $ such that $ u= w [i_1] w [i_2]\dots w [i_ {k}] $,
for some set of indices $1\leq i_1< i_2<\dots< i_k\leq\lvert w\rvert $. A word $ w $ is $ k …

In this overview, I present chronologically the published articles to which I contributed during
my doctoral studies. The papers that make up the chapters of this thesis, that is, Paper 1 [69] …

This Chapter is divided into four sections. In the first Section 1.1, I will introduce the original
problem of matching patterns with variables, which is the central underlying concept for the …

Abstract The traditional Chinese-English translation model tends to translate some source
words repeatedly, while mistakenly ignoring some words. Therefore, we propose a novel …

We consider the longest common subsequence problem in the context of subsequences
with gap constraints. In particular, following Day et al. 2022 [2], we consider the setting when …