Results 31 to 40 of about 1,772,421 (241)
Deciding the Borel complexity of regular tree languages
, 2014 We show that it is decidable whether a given a regular tree language belongs to the class ${\bf \Delta^0_2}$ of the Borel hierarchy, or equivalently whether the Wadge degree of a regular tree language is countable.Comment: 15 pages, 2 ...
A. Blumensath +8 more
core +1 more source
The cognitive roots of regularization in language
Cognition, 2019 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
Molecular Oncology, EarlyView.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
Generalization of automatic sequences for numeration systems on a regular language [PDF]
, 1999 Let L be an infinite regular language on a totally ordered alphabet (A,
Allouche +7 more
core +3 more sources
The dissecting power of regular languages [PDF]
Information Processing Letters, 2013 A recent study on structural properties of regular and context-free languages has greatly promoted our basic understandings of the complex behaviors of those languages. We continue the study to examine how regular languages behave when they need to cut numerous infinite languages.
Yuichi Kato, Tomoyuki Yamakami
openaire +2 more sources
Molecular Oncology, EarlyView.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
Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages
, 2011 For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular.
Christof Löding +25 more
core +2 more sources
On the intersection of regex languages with regular languages
Theoretical Computer Science, 2009 AbstractIn this paper we revisit the semantics of extended regular expressions (regex), defined succinctly in the 90s [A.V. Aho, Algorithms for finding patterns in strings, in: Jan van Leeuwen (Ed.), Handbook of Theoretical Computer Science, in: Algorithms and Complexity, vol. A, Elsevier and MIT Press, 1990, pp.
Cezar Câmpeanu, Nicolae Santean
openaire +2 more sources
Numeration Systems on a Regular Language [PDF]
Theory of Computing Systems, 2000 Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of numeration, we show that ultimately periodic sets are recognizable.
Michel Rigo, Pierre B. A. Lecomte
openaire +3 more sources
Molecular Oncology, EarlyView.This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani +14 more
wiley +1 more source