47 search results - page 3 / 10 » Learning a Subclass of Regular Patterns in Polynomial Time |
ITA
2007
13 years 5 months ago
2007
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
ICGI
2004
Springer
13 years 10 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...
LATA
2009
Springer
14 years 1 days ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
ALT
2003
Springer
13 years 9 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
ICGI
2010
Springer
13 years 6 months ago
2010
Springer
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...