Sciweavers

762 search results - page 65 / 153
» Intercode Regular Languages
Sort
View
ODBIS
2007
Springer
157views Database» more  ODBIS 2007»
15 years 10 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é...
ENTCS
2006
174views more  ENTCS 2006»
15 years 4 months ago
Context Sequence Matching for XML
Context and sequence variables allow matching to explore term-trees both in depth and in breadth. It makes context sequence matching a suitable computational mechanism for a rule-...
Temur Kutsia
BIRTHDAY
2004
Springer
15 years 9 months ago
Splicing to the Limit
We consider the result of a wet splicing procedure after the reaction has run to its completion, or limit, and we try to describe the molecules that will be present at this final ...
Elizabeth Goode, Dennis Pixton
IJWGS
2006
125views more  IJWGS 2006»
15 years 4 months ago
Compiling business processes: untangling unstructured loops in irreducible flow graphs
: This paper presents a systematic study of some major problems involved in the transformation of business process modelling languages to executable business process representation...
Wei Zhao, Rainer Hauser, Kamal Bhattacharya, Barre...
125
Voted
ICGI
2004
Springer
15 years 9 months ago
Identifying Left-Right Deterministic Linear Languages
Abstract. Left deteministic linear languages are a subclass of the context free languages that includes all the regular languages. Recently was proposed an algorithm to identify in...
Jorge Calera-Rubio, José Oncina