Results 91 to 100 of about 14,469 (313)
Finite Automata Implementations Considering CPU Cache
The finite automata are mathematical models for finite state systems. More general finite automaton is the nondeterministic finite automaton (NFA) that cannot be directly used.
J. Holub
doaj
This paper presents a modelling strategy that combines Neuro-Fuzzy methods to define the material model with Cellular Automata representations of the microstructure, all embedded within a Finite Element solver that can deal with the large deformations of
Zhu, Q +6 more
core
Tunable 3D‐Printed Static Mixers for Gradient Bioprinting With High Cell Viability
ABSTRACT The fabrication of native tissue‐like structures with gradual transitions in material properties, cell types, and growth factors remains a major challenge in biofabrication due to the lack of suitable methods. Mimicking the hierarchical organization of living tissues is essential for functional models, yet creating gradient, multimaterial ...
Florian Hofmann +9 more
wiley +1 more source
Finite Automata Capturing Winning Sequences for All Possible Variants of the PQ Penny Flip Game
The meticulous study of finite automata has produced many important and useful results. Automata are simple yet efficient finite state machines that can be utilized in a plethora of situations. It comes, therefore, as no surprise that they have been used
Theodore Andronikos +5 more
doaj +1 more source
We introduce an additively manufactured bioreactor with a perfusion flow system and integrated temperature and pH sensors for skeletal muscle tissue biofabrication. The bioreactor's performance was evaluated by assessing the viability, spreading of the myoblast cells in a printed scaffold, and contraction of the isolated murine musculi interossei ...
Lys Sprenger +9 more
wiley +1 more source
Robust finite automata in stochastic chemical reaction networks. [PDF]
Arredondo D, Lakin MR.
europepmc +1 more source
Decision procedures for families of deterministic pushdown automata [PDF]
The existence and complexity of decision procedures for families of deterministic pushdown automata are investigated, with special emphasis on positive decidability results for those questions, such as equivalence, which are known to become ...
Valiant, Leslie
core
Improved learning automata applied to routing in multi-service networks [PDF]
Multi-service communications networks are generally designed, provisioned and configured, based on source-destination user demands expected to occur over a recurring time period.
Aranzulla, P.J., Aranzulla, Philip John
core
From Rigid to Soft Robotic Approaches for Neuroendoscopy
Robotic assistance has had minimal impact on deep intraventricular surgeries, where small‐scale, precision, and reduced invasiveness can contribute to improved patient outcomes. Emerging technologies in rigid, soft, and hybrid robotics are reviewed to identify the most promising mechanisms for deep brain navigation in addition to an attempt to identify
Kieran Gilday +3 more
wiley +1 more source
Probabilistic Deterministic Finite Automata and Recurrent Networks, Revisited. [PDF]
Marzen SE, Crutchfield JP.
europepmc +1 more source

