Results 61 to 70 of about 14,469 (313)
Theoretical Computer Science, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Regular Languages: To Finite Automata and Beyond Succinct : Descriptions and Optimal Simulations [PDF]
, 2021 It is well known that the class of regular languages coincides with the class of languages recognized by finite automata. Nevertheless, many other characterizations of this class in terms of computational devices and generative models are present in the ...
Luca Prigioniero, Prigioniero, Luca
core +1 more source
Advanced Healthcare Materials, EarlyView.This systematic review quantitatively compares conventional mechanical stimulation strategies in cartilage tissue engineering across 85 heterogeneous in vitro studies. Applying standardized effect measures, meta‐analysis reveals that combined compression and shear loading optimally promotes cartilage matrix development.
Jiaqi K. Shen +7 more
wiley +1 more source
Logic and Branching Automata [PDF]
Logical Methods in Computer Science, 2015 In this paper we study the logical aspects of branching automata, as defined by Lodaya and Weil. We first prove that the class of languages of finite N-free posets recognized by branching automata is closed under complementation.
Bedon Nicolas
doaj +1 more source
Plasmonic Enhancement of Fluorescence and Protein Dynamics in Living Mammalian Cells
Advanced Materials, EarlyView.This study demonstrates plasmonic enhancement of the function of fluorescent voltage sensing proteins (genetically encoded voltage indicators, (GEVIs), QuasAr6) in live mammalian cells. Coupling to plasmonic nanoparticles does not just increase fluorescence, but influences the protein photocycle, creating a hybrid sensor with its response speed to ...
Marco Locarno +16 more
wiley +1 more source
Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 We consider parallel communicating pushdown automata systems (PCPA) and define a property called known communication for it. We use this property to prove that the power of a variant of PCPA, called returning centralized parallel communicating pushdown ...
M. Sakthi Balan
doaj +1 more source
On the Representation of Finite Automata
CoRR, 2009 We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFAs) with n states over an alphabet of k symbols. We show how to generate all these strings for each n and k, and how its enumeration provides an alternative way to obtain the exact number of ICDFAs.
Rogério Reis +2 more
openaire +2 more sources
Advanced Materials, EarlyView.AI‐Assisted Workflow for (Scanning) Transmission Electron Microscopy: From Data Analysis Automation to Materials Knowledge Unveiling. Abstract (Scanning) transmission electron microscopy ((S)TEM) has significantly advanced materials science but faces challenges in correlating precise atomic structure information with the functional properties of ...
Marc Botifoll +19 more
wiley +1 more source
Robust biomolecular finite automata
Theoretical Computer Science, 2020 We present a uniform method for translating an arbitrary nondeterministic finite automaton (NFA) into a deterministic mass action input/output chemical reaction network (I/O CRN) that simulates it. The I/O CRN receives its input as a continuous time signal consisting of concentrations of chemical species that vary to represent the NFA's input string in
Titus H. Klinge +2 more
openaire +4 more sources
Advanced Materials, EarlyView.Drawing inspiration from the layered hard‐soft architecture found in sea sponges, this work establishes a new framework for architected cementitious composites (ACC) through multi‐material additive manufacturing (MMAM) process. The integration of mortar and elastomer phases into layered architectures enables synergistic toughening mechanisms, including
Aimane Najmeddine +5 more
wiley +1 more source