47 search results - page 1 / 10 » Learning a Subclass of Regular Patterns in Polynomial Time |
76
Voted
ALT
2003
Springer
15 years 7 months ago
2003
Springer
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
85
Voted
COLT
1992
Springer
15 years 2 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
99
Voted
IJCAI
1993
14 years 11 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
96
Voted
ICGI
2010
Springer
14 years 11 months ago
2010
Springer
This paper presents an efficient algorithm that identifies a rich subclass of multiple context-free languages in the limit from positive data and membership queries by observing wh...
JALC
2007
14 years 10 months ago
2007
Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin’s and Sakakib...