Extended finite automata (EFAs), i.e., deterministic finite automata extended with variables, provide compact state representation and then make the control logic transparent through logic expressions of the va
_0, \Delta , L\rangle where Q is a finite set of states, q_0 \in Q is the initial state, I and O are finite sets of input and output symbols, \Delta : Q \times I\rightarrow Dist (Q) is the probabilistic transition function, and L: Q \rightarrow O is the labeling function...
The subclass of extended automata on which the procedure termi- nates is characterised as bounded-lookahead automata, for which the observation of a bounded-length trace is enough to infer the first transition actually taken. The result is nontrivial because the order in which local determinis...
We define and investigate a complexity measure defined for extended finite automata over groups (EFA). Roughly, an EFA is a finite automaton augmented with a register storing an element of a group, initially the identity element. When a transition is performed, not only the state, but the ...
An example of this is the special case of transition conditions used to model mutual exclusion of shared resources, where the conversion results in a significantly reduced problem formulation. The objective function is then built by summarizing weighted state cost functions and the result is a Mixed...
, volume fraction of void growthfgrowth, void size ratioχ, and equivalent plastic strainare illustrated in Fig. 28. The void nucleation rate follows a Gaussian function of the strain around the nucleation strain (Ref53) and is not influenced byf0. Therefore, the nucleation rate of voids rem...
We first consider T-algebras which are equipped with a transition structure similar to that of Moore automata but which, in addition, preserves the algebraic structure. Such a transition structure extends a T- algebra with dynamic behaviour (making it into a coalgebra) and hence we call such ...
A visibly pushdown class memory automaton is a tuple , where Q is a finite set of states, q0∈Q is the initial state, FG⊆FL⊆Q are sets of globally and locally accepting states respectively, Γ a finite stack alphabet and Δ is the transition relation, where: Δ⊆(Q×Q⊥×(Σ...
function BSDF Bidirectional scattering distribution function BTDF Bidirectional transmittance distribution function CA Cellular automata CPU Central processing unit CUDA Compute unified device architecture DEM Discrete element method FV Finite volumes GPU Graphics processing unit LBHM Laser beam ...
cellular automatacollision-based computingreaction-diffusion computingspiral ruleSummary: We investigate the glider-eater interaction in a 2-dimensional reaction-diffusion cellular automaton, the Adamatzky-Wuensche spiral rule. We present the complete state transition table of such interactions, with which ...