759 search results - page 27 / 152 » Odometers on Regular Languages |
DNA
2004
Springer
15 years 3 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...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
69
Voted
ACL
2010
14 years 8 months ago
2010
Strictly Piecewise (SP) languages are a subclass of regular languages which encode certain kinds of long-distance dependencies that are found in natural languages. Like the classe...
MST
2006
14 years 10 months ago
2006
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...