Sciweavers

559 search results - page 48 / 112
» Augmented Marked Graphs
Sort
View
CAV
2006
Springer
129views Hardware» more  CAV 2006»
14 years 20 days ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
ENTCS
2006
109views more  ENTCS 2006»
13 years 9 months ago
Specifications via Realizability
We present a system, called RZ, for automatic generation of program specifications from mathematical theories. We translate mathematical theories to specifications by computing th...
Andrej Bauer, Christopher A. Stone
NC
2010
137views Neural Networks» more  NC 2010»
13 years 3 months ago
On the regularity of circular splicing languages: a survey and new developments
Circular splicing has been introduced to model a specific recombinant behaviour of circular DNA, continuing the investigation initiated with linear splicing. In this paper we focu...
Paola Bonizzoni, Clelia de Felice, Gabriele Fici, ...
GG
2008
Springer
13 years 10 months ago
Adaptive Star Grammars for Graph Models
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
Frank Drewes, Berthold Hoffmann, Mark Minas
IJRR
2008
92views more  IJRR 2008»
13 years 9 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...