84 search results - page 1 / 17 » Efficient Enumeration of Regular Languages |
WIA
2007
Springer
13 years 11 months ago
2007
Springer
WIA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
COCOON
2009
Springer
13 years 8 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...
JUCS
2002
13 years 5 months ago
2002
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
AFL
2011
12 years 5 months ago
2011
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...