Results 81 to 90 of about 14,469 (313)
1 Finite-State Automata: Characterization Finite-State Acceptors [PDF]
, 2012 Definition (Non-deterministic finite-state acceptor (NFA)) A non-deterministic finite-state acceptor A is a 5-tuple (Q, Σ, q0, F, δ) where Q is a finite set of states Σ is the alphabet q0 ∈ Q is the start state F ⊆ Q is a set of final states δ: Q × Σ ...
Nina Seemann, Finite-state Transducers
core
The finite automata approaches in stringology [PDF]
, 2012 summary:We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of ...
Holub, Jan
core +1 more source
Advanced Materials, EarlyView.This work develops bias‐triggered conductivity relaxation as a novel technique to study oxygen reactions in mixed ionic‐electronic conducting thin films by integrating electrochemical titration and electrical conductivity relaxation to achieve synchronous multi‐parameter characterization, providing simultaneous electronic, ionic, and extraordinarily ...
Alexander Stangl +4 more
wiley +1 more source
Minimizing finite automata is computationally hard
, 2002 It is known that deterministic finite automata (DFAs) can be algorithmically minimized, i.e., a DFA M can be converted to an equivalent DFA M' which has a minimal number of states. The minimization can be done efficiently [6].
Malcher, Andreas
core
Advanced Design for Weakly Coupled Resonators by Automatic Active Optimization
Advanced Materials Technologies, EarlyView.An Automatic Active Optimization (AAO) strategy integrates machine learning predictors and genetic algorithms in a closed‐loop workflow. By iteratively expanding its dataset with new discoveries, AAO overcomes the limits of conventional methods. This approach finds superior microstructural designs beyond the initial sample space. We demonstrate this on
Wei Yue +8 more
wiley +1 more source
On Finitely Ambiguous Büchi Automata [PDF]
, 2018 Unambiguous Büchi automata, i.e. Büchi automata allowing only one accepting run per word, are a useful restriction of Büchi automata that is well-suited for probabilistic model-checking. In this paper we propose a more permissive variant, namely finitely ambiguous Büchi automata, a generalisation where each word has at most $k$ accepting runs, for some
Christof Löding, Anton Pirogov
openaire +2 more sources
Algebraic Methods for Finite Linear Cellular Automata
, 1996 PhDCellular automata are a simple class of extended dynamical systems which have been much studied in recent years. Linear cellular automata are the class of cellular automata most amenable to algebraic analytic treatments, algebraic techniques are ...
Dow, R. A.
core
, 2005 MONA implements an efficient decision procedure for the logic WS1S, and has already been applied in many non-trivial problems. Among these, we follow on from previous work done by Smith and Klarlund on the verification of a sliding-window protocol.
Howard Bowman +2 more
core
Advanced Materials Technologies, EarlyView.This review explores advances in wearable and lab‐on‐chip technologies for breast cancer detection. Covering tactile, thermal, ultrasound, microwave, electrical impedance tomography, electrochemical, microelectromechanical, and optical systems, it highlights innovations in flexible electronics, nanomaterials, and machine learning.
Neshika Wijewardhane +4 more
wiley +1 more source
Recent Advances of Slip Sensors for Smart Robotics
Advanced Materials Technologies, EarlyView.This review summarizes recent progress in robotic slip sensors across mechanical, electrical, thermal, optical, magnetic, and acoustic mechanisms, offering a comprehensive reference for the selection of slip sensors in robotic applications. In addition, current challenges and emerging trends are identified to advance the development of robust, adaptive,
Xingyu Zhang +8 more
wiley +1 more source