Results 91 to 100 of about 194,426 (295)
Multipass automata and group word problems
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean closure of the
Ceccherini-Silberstein, Tullio +4 more
core +3 more sources
Sand automata as cellular automata
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dennunzio, Alberto +2 more
openaire +3 more sources
Amino acids sequence of two different proteins with the same sequence (chameleon sequence—black boxes) represent in 3D structure of the proteins different secondary structures: HHHH—helical and BBB—Beta‐structural. The chains folded in water environment adopt different III‐order structures in which the chameleon fragments appear to adopt similar status
Irena Roterman +4 more
wiley +1 more source
Verification of on-demand medical device networks
We propose a novel method for the automated formal analysis of on-demand medical device networks communicating via an open communication protocol. The resulting toolbox aims at assisting operators of cross-vendor medical device networks in the complex ...
Dingler Max, Dietz Christian, Lüth Tim
doaj +1 more source
Phase Space Invertible Asynchronous Cellular Automata
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata.
Wacker, Simon, Worsch, Thomas
core +2 more sources
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
On structure of isomorphisms of universal graphic automata [PDF]
Automata theory is one of the branches of mathematical cybernetics, that studies information transducers that arise in many applied problems. The major objective of automata theory is to develop methods by which one can describe and analyze the dynamic ...
Molchanov, Vladimir Aleksandrovich +1 more
doaj +1 more source
Analyzing Timed Systems Using Tree Automata
Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such
Akshay, S. +2 more
core +2 more sources
Pharmacological inhibition of PERK in a DEN‐induced mouse model of liver cancer does not reduce tumor burden but alters cellular stress signaling. Despite blocking PERK activity, downstream stress responses, including CHOP expression, remain active, suggesting compensatory mechanisms within the unfolded protein response that may influence tumor ...
Ada Lerma‐Clavero +5 more
wiley +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source

