1052 search results - page 59 / 211 » The Regular Real-Time Languages |
113
click to vote
COLING
2010
14 years 10 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...
130
Voted
ICGI
2010
Springer
15 years 4 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...
138
click to vote
CSL
2001
Springer
15 years 8 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...
118
click to vote
DNA
2004
Springer
15 years 9 months ago
2004
Springer
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
108
Voted
ITICSE
2005
ACM
15 years 9 months ago
2005
ACM
FAdo1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages. In this paper we focus in the description of in...