[PDF] Top 20 Partial Higher-Dimensional Automata
Has 2993 "Partial Higher-Dimensional Automata" found on our website. Below are the top 20 most common "Partial Higher-Dimensional Automata".
Partial Higher-Dimensional Automata
... 7 Conclusion and Further Work We have introduced a generalization of higher-dimensional automata, partial HDA, which alleviates some modeling shortcomings of HDA. We have seen that PHDA are ... Voir le document complet
16
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
... 2 Higher-Dimensional Automata As a formalism for concurrent behavior, HDA have the specific feature that they can express all higher-order dependencies between events in a concurrent ... Voir le document complet
21
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
... [2] Uli Fahrenberg. A category of higher-dimensional automata. In FOS- SACS , volume 3441 of LNCS, pages 187–201. Springer, 2005. [3] Uli Fahrenberg and Axel Legay. History-preserving bisimilarity ... Voir le document complet
2
Homotopy Bisimilarity for Higher-Dimensional Automata
... Our results imply decidability of homotopy bisimilarity for finite HDA. They also put homotopy bisimilarity firmly into the open-maps framework of [18] and tighten the connec- tions between bisimilarity and weak ... Voir le document complet
24
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
... In summary, a PPA accepting a language encoding a set of n-dimensional vectors can be seen as n distinct finite-state automata, each of them recognizing sets with a specific dimension in {1, . . . , n}, ... Voir le document complet
12
Improving kriging surrogates of high-dimensional design models by Partial Least Squares dimension reduction
... 5 Conclusion and future work Engineering problems that require integrating surrogate models into an optimization process are receiving increasing interest within the multidisciplinary optimization commu- nity. ... Voir le document complet
20
A New class of multi-dimensional Teager Kaiser and higher order operators based on directional derivatives
... To overcome this problem, in this paper a new method that is robust against noise to compute the frequency components of a n-D signal by fixing the sign of each component is introduced. A new multi-dimensional ... Voir le document complet
23
Partial regularity for the crack set minimizing the two-dimensional Griffith energy
... to treat in this paper minimizers of the global functional only. Comments about the proof. The Griffith energy is similar to the classical Mumford-Shah energy for some aspects, but it actually necessitates the introduction ... Voir le document complet
39
Higher dimensional extensions of substitutions and their dual maps
... E 2 ( ) de ned below sends a square exactly to a square (with opposite orientation if the deter- minant of the substitution is -1) it is tempting to ask whether this result can be generalized to more letters, and we ... Voir le document complet
20
Inverse monoids of higher-dimensional strings
... 4. some well-defined and rich subclasses of these generalized strings still has efficient, expressive and decidable language theory (Theorem 32). Technically, following the lines already sketched in [18], we use and ... Voir le document complet
19
Improving kriging surrogates of high-dimensional design models by Partial Least Squares dimension reduction
... 5 Conclusion and future work Engineering problems that require integrating surrogate models into an optimization process are receiving increasing interest within the multidisciplinary optimization commu- nity. ... Voir le document complet
19
Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems
... Then, partial obser- vations are defined as finite connected subgraphs of that Cayley graph with two distinguished vertices: one for the input root and the other for the output ...case, partial observations ... Voir le document complet
17
Choreography Automata
... In the above definition loops are taken into account in item (3) since the notion of span is defined in terms of candidate branch. The latter is a maximal run where cycles can be considered at most once, as shown in ... Voir le document complet
22
On reversible automata
... reversible automata of the form B = (Q, A, E, I, F ) where Q contains at most r(N + 1) states and the language accepted by B is contained in ...of automata with at most r(N + 1) ...the automata of ... Voir le document complet
23
Topological properties of sand automata as cellular automata
... 3.3. Some dynamical behaviors SA are very interesting models, whose complexity lies between that of d-dimensional and d + 1-dimensional CA. Indeed, we have seen in the previous section that the latter can ... Voir le document complet
13
Polychronous Automata
... mode automata [ 21 ], but compared to our current proposal, it did not allow to manipulate automata as specific objects that can be used, for instance, to specify dynamic properties of ... Voir le document complet
9
Junior Automata
... 101 - 54602 Villers lès Nancy Cedex France Unité de recherche INRIA Rennes : IRISA, Campus universitaire de Beaulieu - 35042 Rennes Cedex France Unité de recherche INRIA Rhône-Alpes : 65[r] ... Voir le document complet
27
Representing Reversible Cellular Automata with Reversible Block Cellular Automata
... We built a simulation in linear time of reversible cellular automata by reversible block cellular automata also known as partitioning CA and CA with the Margolus neighborhood which is va[r] ... Voir le document complet
11
Rigid Tree Automata
... tree automata (RTA) by the identification of some states as rigid, and the condition that the subterms recognized in one rigid state during a computation are all ...of automata and decision problems for ... Voir le document complet
13
Asynchronous logic automata
... Numerous applications, from high-performance scientific computing to large, high- resolution multi-touch interfaces to strong artifical intelligence, push the practical physical limits of modern computers. Typical ... Voir le document complet
92
Sujets connexes