Results 61 to 70 of about 1,782,235 (292)
Sch¨utzenberger hierarchy of regular languages and algorithms for testing low levels of hierarchy
Вестник Самарского университета: Естественнонаучная серияWe discuss deterministic finite automata and their syntactic monoids. We provide examples of finitely generated monoids with two generators that exhibit polynomial growth in the number of elements.
M. Ya. Novikov, N. I. Krainiukov
doaj +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 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
Emerging experimental and computational methods for studying redox‐regulated structural transitions
FEBS Letters, EarlyView.Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass +2 more
wiley +1 more source
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law.
Ryoma Sin'ya
doaj +1 more source
Regular component decomposition of regular languages
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Syntactic structures of regular languages [PDF]
Theoretical Computer Science, 2019 We introduce here the notion of syntactic lattice algebra which is an analogy of the syntactic monoid and of the syntactic semiring. We present a unified approach to get those three structures.
Ondrej Klíma 0001, Libor Polák
openaire +3 more sources
Prospecting the protein design landscape
FEBS Letters, EarlyView.This review outlines the current state of various protein design approaches. We discuss the current possibilities enabled by recently released tools, highlight future avenues to pursue in protein design, and underscore the crucial role of key databases and resources for successful protein design workflows.
Jakob R. Riccabona +4 more
wiley +1 more source
Recognizable Hexagonal Picture Languages and xyz domino tiles
Ratio Mathematica, 2021 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
Regular realizability problems and regular languages
CoRR, 2015 We investigate regular realizability (RR) problems, which are the problems of verifying whether intersection of a regular language -- the input of the problem -- and fixed language called filter is non-empty. We consider two kind of problems depending on representation of regular language. If a regular language on input is represented by a DFA, then we
openaire +3 more sources