Sciweavers

278 search results - page 26 / 56
» Enumerating Regular Expressions and Their Languages
Sort
View
ODBIS
2007
Springer
157views Database» more  ODBIS 2007»
14 years 1 months ago
An Extension of SPARQL for RDFS
Abstract. RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet...
Marcelo Arenas, Claudio Gutierrez, Jorge Pé...
LCR
1998
Springer
109views System Software» more  LCR 1998»
13 years 11 months ago
Expressing Irregular Computations in Modern Fortran Dialects
Abstract. Modern dialects of Fortran enjoy wide use and good support on highperformance computers as performance-oriented programming languages. By providing the ability to express...
Jan Prins, Siddhartha Chatterjee, Martin Simons
NLPRS
2001
Springer
13 years 12 months ago
Migemo: Incremental Search Method for Languages with Many Character Faces
We introduce a new incremental search method called Migemo for languages with many character faces. Migemo performs the incremental search by dynamically expanding the input patte...
Satoru Takabayashi, Hiroyuki Komatsu, Toshiyuki Ma...
RTA
2000
Springer
13 years 11 months ago
Parallelism Constraints
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
Katrin Erk, Joachim Niehren
LATA
2009
Springer
14 years 2 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger