Search Results for author:
Found 7 papers, 1 papers with code
$α$-$β$-Factorization and the Binary Case of Simon's Congruence
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).
On the Self Shuffle Language
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\).
m-Nearly k-Universal Words -- Investigating Simon Congruence
We present a full characterisation as well as the index of the congruence for $m=1$.
Responsible and Regulatory Conform Machine Learning for Medicine: A Survey of Challenges and Solutions
This survey provides an overview of the technical and procedural challenges involved in creating medical machine learning systems responsibly and in conformity with existing regulations, as well as possible solutions to address these challenges.
String Theories involving Regular Membership Predicates: From Practice to Theory and Back
Designing an algorithm for the (generally undecidable) satisfiability problem for systems of string constraints requires a thorough understanding of the structure of constraints present in the targeted cases.
Scattered Factor Universality -- The Power of the Remainder
Scattered factor (circular) universality was firstly introduced by Barker et al. in 2020.
An Empirical Investigation of Randomized Defenses against Adversarial Attacks
In this paper, we propose a scientific evaluation methodology aimed at assessing the quality, efficacy, robustness and efficiency of randomized defenses to protect DNNs against adversarial examples.
