Sciweavers

51 search results - page 3 / 11
» Subset Seed Automaton
Sort
View
CAD
2008
Springer
13 years 11 months ago
Detecting approximate symmetries of discrete point subsets
Detecting approximate symmetries of parts of a model is important when attempting to determine the geometric design intent of approximate boundary-representation (B-rep) solid mod...
Ming Li, Frank C. Langbein, Ralph R. Martin
RAS
2006
86views more  RAS 2006»
13 years 10 months ago
Using cellular automata and gradients to control self-reconfiguration
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
Kasper Støy
GG
2008
Springer
13 years 12 months ago
On the Recognizability of Arrow and Graph Languages
In this paper we give a category-based characterization of recognizability. A recognizable subset of arrows is defined via a functor into the category of relations on sets, which ...
Harrie Jan Sander Bruggink, Barbara König
ICALP
2007
Springer
14 years 5 months ago
Bounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
Henrik Björklund, Mikolaj Bojanczyk
ISAAC
2001
Springer
87views Algorithms» more  ISAAC 2001»
14 years 3 months ago
On Removing the Pushdown Stack in Reachability Constructions
A discrete pushdown timed automaton is a pushdown machine with integer-valued clocks. It has been shown recently that the binary reachability of a discrete pushdown timed automaton...
Oscar H. Ibarra, Zhe Dang