Zobrazeno 1 - 10
of 228
pro vyhledávání: '"Nowotka, Dirk"'
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$-subsequence universal over an alphabet $\Sigma$ if every word in $
Externí odkaz:
http://arxiv.org/abs/2311.10658
Autor:
Fleischmann, Pamela, Kim, Sungmin, Koß, Tore, Manea, Florin, Nowotka, Dirk, Siemer, Stefan, Wiedenhöft, Max
We introduce and investigate a series of matching problems for patterns with variables under Simon's congruence. Our results provide a thorough picture of these problems' computational complexity.
Externí odkaz:
http://arxiv.org/abs/2308.08374
In 1991 H\'ebrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or subsequences). Based on this, first Karandikar and Schnoebelen intr
Externí odkaz:
http://arxiv.org/abs/2306.14192
We study decision problems of the form: given a regular or linear context-free language $L$, is there a word of a given fixed form in $L$, where given fixed forms are based on word operations copy, marked copy, shuffle and their combinations.
Externí odkaz:
http://arxiv.org/abs/2302.06248
Autor:
Day, Joel D., Kröger, Adrian, Kulczynski, Mitja, Manea, Florin, Nowotka, Dirk, Poulsen, Danny Bøgsted
String constraint solving, and the underlying theory of word equations, are highly interesting research topics both for practitioners and theoreticians working in the wide area of satisfiability modulo theories. As string constraint solving algorithm
Externí odkaz:
http://arxiv.org/abs/2208.08806
The shuffle product \(u\shuffle v\) of two words \(u\) and \(v\) is the set of all words which can be obtained by interleaving \(u\) and \(v\). Motivated by the paper \emph{The Shuffle Product: New Research Directions} by Restivo (2015) we investigat
Externí odkaz:
http://arxiv.org/abs/2202.07988
Determining the index of the Simon congruence is a long outstanding open problem. Two words $u$ and $v$ are called Simon congruent if they have the same set of scattered factors, which are parts of the word in the correct order but not necessarily co
Externí odkaz:
http://arxiv.org/abs/2202.07981
Publikováno v:
EPTCS 338, 2021, pp. 31-38
In recent years there has been a considerable effort in optimising formal methods for application to code. This has been driven by tools such as CPAChecker, DIVINE, and CBMC. At the same time tools such as Uppaal have been massively expanding the rea
Externí odkaz:
http://arxiv.org/abs/2108.02963
Autor:
Petersen, Eike, Potdevin, Yannik, Mohammadi, Esfandiar, Zidowitz, Stephan, Breyer, Sabrina, Nowotka, Dirk, Henn, Sandra, Pechmann, Ludwig, Leucker, Martin, Rostalski, Philipp, Herzog, Christian
Publikováno v:
IEEE Access, Vol. 10, pp. 58375-58418, 2022
Machine learning is expected to fuel significant improvements in medical care. To ensure that fundamental principles such as beneficence, respect for human autonomy, prevention of harm, justice, privacy, and transparency are respected, medical machin
Externí odkaz:
http://arxiv.org/abs/2107.09546
When unexpected incidents occur, new innovative and flexible solutions are required. If this event is something such radical and dramatic like the COVID-19 pandemic, these solutions must aim to guarantee as much normality as possible while protecting
Externí odkaz:
http://arxiv.org/abs/2107.04014