Sciweavers

268 search results - page 5 / 54
» Linear Context Free Languages
Sort
View
FLOPS
2008
Springer
13 years 9 months ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal
DLT
2009
13 years 5 months ago
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
Makoto Kanazawa
JCSS
2002
58views more  JCSS 2002»
13 years 7 months ago
Context-Free Languages of Sub-exponential Growth
Abstract. There do not exist context
Martin R. Bridson, Robert H. Gilman
JMLR
2010
134views more  JMLR 2010»
13 years 2 months ago
Using Contextual Representations to Efficiently Learn Context-Free Languages
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...
Alexander Clark, Rémi Eyraud, Amaury Habrar...
DLT
2009
13 years 5 months ago
Strongly Regular Grammars and Regular Approximation of Context-Free Languages
Abstract. We consider algorithms for approximating context
Ömer Egecioglu