Results 61 to 70 of about 1,535,797 (279)
Construction of a Minimal Deterministic Finite Automaton from a Regular Expression
This paper describes a method for constructing a minimal deterministic finite automaton (DFA) from a regular expression. It is based on a set of graph grammar rules for combining many graphs (DFA) to obtain another desired graph (DFA). The graph grammar rules are presented in the form of a parsing algorithm that converts a regular expression R into a ...
G. N. Purohit, Sanjay Bhargava
openaire +1 more source
We present elastomeric three‐dimensional (3D) microstructures fabricated via two‐photon polymerization (2PP) and post‐processed through wet etching, for quantifying nanonewton (nN)‐scale forces applied by healthy and diseased neural cells. The mechanically characterized free‐standing beam architectures enable measurement of traction forces of ...
Pieter F. J. van Altena +7 more
wiley +1 more source
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
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj +1 more source
The Deterministic Finite State Automaton (DFA) constructed from the PTA by state merging method.
The Deterministic Finite State Automaton (DFA) constructed from the PTA by state merging method.
Sutapa Datta (379708) +1 more
core +1 more source
Water harvesting, radiative cooling, and interfacial solar evaporation are fundamentally governed by coupled heat, mass, and light transport processes. These processes are mediated by pore architecture, including pore size, connectivity, and hierarchical organization.
Dejan J. Trajkovski +5 more
wiley +1 more source
HYPER K-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON [PDF]
In this note first we define a hyper K-algebra S on the states of a deterministic ¯nite automaton. Thenwe obtain some commutative hyper K-ideals of types 3, 4, 5, 6 and 9 and also positive implicative hyper K-ideals of types 1, 2, 3, 4, 5, 6, 7, 8 ...
Golmohamadian, M., Zahedi, M.M.
core +1 more source
In this note, the application of a plant model-based fault detection method for nonlinear control systems on aircraft takeoff is introduced. This method utilizes non-deterministic finite-state automata, which approximate the fault-free dynamics of the ...
Ferdinand Settele +2 more
doaj +1 more source
Composing short 3-compressing words on a 2-letter alphabet [PDF]
A finite deterministic (semi)automaton A = (Q, Σ, δ) is k-compressible if there is some word w ∈ Σ + such that theimage of its state set Q under the natural action of w is reduced by at least k states.
Alessandra Cherubini +2 more
doaj +1 more source
Advanced Manufacturing of Composite‐Based Systems for Energy Applications
Advanced manufacturing enables the integration of polymers, ceramics, metal oxides, and composites into architected microstructures with tailored transport pathways. By coupling material selection, manufacturing strategy, and structural design, multifunctional energy systems can simultaneously improve electrochemical performance, thermal management ...
Sri Vaishnavi Thummalapalli +13 more
wiley +1 more source

