Results 81 to 90 of about 4,638,570 (374)
Non-termination using Regular Languages [PDF]
We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ regular (tree) automata.Comment: Published at International Workshop on ...
Endrullis, Jörg, Zantema, Hans
core +1 more source
On the intersection of regex languages with regular languages
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]
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
Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages [PDF]
Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA.
Paola Bonizzoni+2 more
doaj +1 more source
Recognizable Hexagonal Picture Languages and xyz domino tiles
In the paper "Hexagonal Pattern Languages" K S Dersanambika et.al. define xyz- domino systems and characterized hexagonal pictures using this. Here we define xyz local hexagonal picture languages where the usual notion of hexagonal tiles of size (2, 2, 2 ...
Anitha Pancratius+1 more
doaj +1 more source
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
AbstractWe characterize here the free partially commutative monoids the regular sets of which form a Boolean algebra or are all unambiguous: these are, in both cases, the free products of free commutative monoids. This result has been established independently by other authors but the method used here is original.
openaire +2 more sources
Loss of proton‐sensing GPR4 reduces tumor progression in mouse models of colon cancer
G protein‐coupled receptor 4 (GPR4) is a pH‐sensing receptor activated by acidic pH. GPR4 expression is increased in patients with inflammatory bowel disease who are at high risk of developing colorectal cancer. In mouse models, loss of GPR4 attenuated tumor progression. This correlated with increased IL2 and natural killer cell activity.
Leonie Perren+16 more
wiley +1 more source
Commutative Languages and their Composition by Consensual Methods [PDF]
Commutative languages with the semilinear property (SLIP) can be naturally recognized by real-time NLOG-SPACE multi-counter machines. We show that unions and concatenations of such languages can be similarly recognized, relying on – and further ...
Stefano Crespi Reghizzi+1 more
doaj +1 more source
On the periodicity of regular languages
A subclass of regular languages called periodic languages and the corresponding finite automata having nontrivial periodic structure are characterized in this paper. Canonical forms of the regular expressions representing such periodic languages are presented.
openaire +2 more sources