84 search results - page 1 / 17 » Efficient Enumeration of Regular Languages |
WIA
2007
Springer
15 years 5 months ago
2007
Springer
WIA
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We discuss enumeration of regular expressions and the distinct languages they represent.
COCOON
2009
Springer
15 years 2 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
14 years 11 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...
124
click to vote
AFL
2011
13 years 11 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 ...