Results 71 to 80 of about 4,638,570 (374)
$k$-Universality of Regular Languages
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 $Σ$ if every word in $Σ^k$ appears in $w$ as a subsequence. In this paper, we study the intersection between the set of $k$
Adamson, Duncan+5 more
openaire +5 more sources
Using Data Mining Algorithms to Discover Regular Sound Changes among Languages [PDF]
This paper presents a method of using association rule data mining algorithms to discover regular sound changes among languages. The method presented has a great potential to facilitate linguistic studies aimed at identifying distantly related cognate ...
Revesz Peter Z.
doaj +1 more source
Regularity of splicing languages
AbstractMotivated by the recombinant behavior of DNA, Tom Head introduced a scheme for the evolution of formal languages called splicing. We give a simpler proof of the fundamental fact that the closure of a regular language under iterated splicing using a finite number of splicing rules is again regular.
openaire +2 more sources
Regular Separability of One Counter Automata [PDF]
The regular separability problem asks, for two given languages, if there exists a regular language including one of them but disjoint from the other.
Wojciech Czerwiński, Sławomir Lasota
doaj +1 more source
Social context prevents heat hormetic effects against mutagens during fish development
This study shows that sublethal heat stress protects fish embryos against ultraviolet radiation, a concept known as ‘hormesis’. However, chemical stress transmission between fish embryos negates this protective effect. By providing evidence for the mechanistic molecular basis of heat stress hormesis and interindividual stress communication, this study ...
Lauric Feugere+5 more
wiley +1 more source
The cognitive roots of regularization in language
Regularization occurs when the output a learner produces is less variable than the linguistic data they observed. In an artificial language learning experiment, we show that there exist at least two independent sources of regularization bias in cognition: a domain-general source based on cognitive load and a domain-specific source triggered by ...
Simon Kirby+3 more
openaire +4 more sources
Non-Deterministic Kleene Coalgebras [PDF]
In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva+2 more
doaj +1 more source
We quantified and cultured circulating tumor cells (CTCs) of 62 patients with various cancer types and generated CTC‐derived tumoroid models from two salivary gland cancer patients. Cellular liquid biopsy‐derived information enabled molecular genetic assessment of systemic disease heterogeneity and functional testing for therapy selection in both ...
Nataša Stojanović Gužvić+31 more
wiley +1 more source
Equality languages and fixed point languages [PDF]
This paper considers equality languages and fixed-point languages of homomorphisms and deterministic gsm mappings. It provides some basic properties of these classes of languages. We introduce a new subclass of dgsm mappings, the so-called symmetric dgsm
Engelfriet, Joost, Rozenberg, Grzegorz
core +2 more sources
There is an unmet need in metastatic breast cancer patients to monitor therapy response in real time. In this study, we show how a noninvasive and affordable strategy based on sequencing of plasma samples with longitudinal tracking of tumour fraction paired with a statistical model provides valuable information on treatment response in advance of the ...
Emma J. Beddowes+20 more
wiley +1 more source