Results 81 to 90 of about 45,402 (287)

AutomataGPT: Transformer‐Based Forecasting and Ruleset Inference for Two‐Dimensional Cellular Automata

open access: yesAdvanced Science, EarlyView.
We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich   +2 more
wiley   +1 more source

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)

open access: yes, 2014
Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids.
Klíma, Ondřej
core   +2 more sources

Endocytic Control of Cell‐Autonomous and Non‐Cell‐Autonomous Functions of p53

open access: yesAdvanced Science, EarlyView.
NUMB Ex3‐containing isoforms localize to the plasma membrane, where they recruit p53 through SNX9 and direct it to multivesicular bodies and exosomes. Exported p53 is taken up by neighboring cells and activates nuclear programs, revealing an intercellular, exosome‐based pathway that might help establish a tumor‐suppressive microenvironment.
Roberta Cacciatore   +20 more
wiley   +1 more source

Timing Mechanotransduction: Mechanically Dynamic Biomaterials Reveal the Temporal Hierarchy of YAP/TAZ Control Nodes

open access: yesAdvanced Science, EarlyView.
This work develops dynamically softening polyacrylamide hydrogels for time‐resolved imaging during continuous mechanical transitions. The study revealed that mechanotransduction is biphasic; YAP/TAZ inactivation is driven by early loss of the nucleocytoskeletal continuum connecting subnuclear adhesions, F‐actin, and the nuclear envelope, coupled with ...
Alessandro Gandin   +12 more
wiley   +1 more source

Deterministic pushdown automata can compress some normal sequences [PDF]

open access: yesLogical Methods in Computer Science
In this paper, we give a deterministic pushdown transducer and a normal sequence of digits compressed by it. This solves positively a question left open in a previous paper by V. Becher, P. A. Heiber and the first author.
Olivier Carton, Sylvain Perifel
doaj   +1 more source

An Increasing Misalignment Between Crop Distribution and Environmental Resources Under Climate Change in China

open access: yesAdvanced Science, EarlyView.
Climate change reshapes the spatial alignment between crop production and environmental resources. Using multi‐source data and a crop model, integrated climatic, water, and soil endowments for maize and wheat are quantified and compared with harvest distributions.
Zheng'e Su   +13 more
wiley   +1 more source

Finite-valued Streaming String Transducers [PDF]

open access: yesTheoretiCS
A transducer is finite-valued if for some bound k, it maps any given input to at most k outputs. For classical, one-way transducers, it is known since the 80s that finite valuedness entails decidability of the equivalence problem.
Emmanuel Filiot   +5 more
doaj   +1 more source

A New Sensing 5'-->3' Watson-Crick Automata Concept

open access: yes, 2017
Watson-Crick (WK) finite automata are working on a Watson-Crick tape, that is, on a DNA molecule. Therefore, it has two reading heads. While in traditional WK automata both heads read the whole input in the same physical direction, in 5'->3' WK automata ...
Mir-Mohammad-Sadeghi, Hamid   +2 more
core   +1 more source

A Perspective on Interactive Theorem Provers in Physics

open access: yesAdvanced Science, EarlyView.
Into an interactive theorem provers (ITPs), one can write mathematical definitions, theorems and proofs, and the correctness of those results is automatically checked. This perspective goes over the best usage of ITPs within physics and motivates the open‐source community run project PhysLean, the aim of which is to be a library for digitalized physics
Joseph Tooby‐Smith
wiley   +1 more source

Constructing Deterministic Parity Automata from Positive and Negative Examples [PDF]

open access: yesTheoretiCS
We present a polynomial time algorithm that constructs a deterministic parity automaton (DPA) from a given set of positive and negative ultimately periodic example words. We show that this algorithm is complete for the class of $\omega$-regular languages,
León Bohn, Christof Löding
doaj   +1 more source

Home - About - Disclaimer - Privacy