Sciweavers

537 search results - page 6 / 108
» A Call to Regularity
Sort
View
CSL
2007
Springer
14 years 1 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk
SPIRE
2010
Springer
13 years 6 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
13 years 7 months ago
Identifying Codes with Small Radius in Some Infinite Regular Graphs
Let G = (V, E) be a connected undirected graph and S a subset of vertices. If for all vertices v V , the sets Br(v) S are all nonempty and different, where Br(v) denotes the set...
Irène Charon, Olivier Hudry, Antoine Lobste...
ADG
2004
Springer
147views Mathematics» more  ADG 2004»
14 years 1 months ago
Computational Origami Construction of a Regular Heptagon with Automated Proof of Its Correctness
Construction of geometrical objects by origami, the Japanese traditional art of paper folding, is enjoyable and intriguing. It attracted the minds of artists, mathematicians and co...
Judit Robu, Tetsuo Ida, Dorin Tepeneu, Hidekazu Ta...
PODS
2005
ACM
129views Database» more  PODS 2005»
14 years 7 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun