Sciweavers

759 search results - page 57 / 152
» Overlap-Free Regular Languages
Sort
View
IJFCS
2010
60views more  IJFCS 2010»
14 years 8 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (Ï...
Andreas Maletti, Catalin Ionut Tîrnauca
ICFP
2008
ACM
15 years 9 months ago
Implicitly-threaded parallelism in Manticore
The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-s...
Matthew Fluet, Mike Rainey, John H. Reppy, Adam Sh...
ICPR
2002
IEEE
15 years 11 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha
ESOP
2010
Springer
15 years 7 months ago
Weighted Dynamic Pushdown Networks
We develop a generic framework for the analysis of programs with recursive procedures and dynamic process creation. To this end we combine the approach of weighted pushdown systems...
Alexander Wenner
SDM
2009
SIAM
130views Data Mining» more  SDM 2009»
15 years 7 months ago
Grammar Mining.
We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
Luc De Raedt, Siegfried Nijssen