67 search results - page 1 / 14 » A Domain-Specific Language for Regular Sets of Strings and T... |
DSL
1997
13 years 6 months ago
1997
JALC
2007
13 years 4 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...
ITA
2007
13 years 4 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...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
TAGT
1994
Springer
13 years 9 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...