33 search results - page 4 / 7 » Neighborhood transformations on graph automata |
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
3DIM
2007
IEEE
14 years 1 months ago
2007
IEEE
We propose an algorithm for surface reconstruction from unorganized points based on a view of the sampling process as a deformation from the original surface. In the course of thi...
IANDC
2006
13 years 7 months ago
2006
This paper generalizes existing connections between automata and logic to a coalgestraction level. Let F : Set Set be a standard functor that preserves weak pullbacks. We introdu...
COR
2006
13 years 7 months ago
2006
Starting from a given one-shot game played by a finite population of agents living in flatline, a circular or constrained grid structured by the classical definitions of neighborh...
WCRE
2007
IEEE
14 years 1 months ago
2007
IEEE
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...