762 search results - page 27 / 153 » Intercode Regular Languages |
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
ICGI
2010
Springer
14 years 10 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...
82
Voted
CSL
2001
Springer
15 years 2 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...
DNA
2004
Springer
15 years 2 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...
ITICSE
2005
ACM
15 years 3 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...