759 search results - page 26 / 152 » Odometers on Regular Languages |
269
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
129
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
145
click to vote
COLING
2010
15 years 1 months ago
2010
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
156
click to vote
ICGI
2010
Springer
15 years 7 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
172
click to vote
CSL
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...