759 search results - page 45 / 152 » Overlap-Free Regular Languages |
111
click to vote
ODBIS
2007
Springer
15 years 3 months ago
2007
Springer
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...
BIRTHDAY
2004
Springer
15 years 3 months ago
2004
Springer
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 ...
ICGI
2004
Springer
15 years 3 months ago
2004
Springer
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...
102
click to vote
JMLR
2010
14 years 4 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
LATA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...