278 search results - page 1 / 56 » Enumerating Regular Expressions and Their Languages |
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 ...
WIA
2007
Springer
13 years 11 months ago
2007
Springer
TON
2012
11 years 7 months ago
2012
—Regular expressions (RegExes) are widely used, yet their inherent complexity often limits the total number of RegExes that can be detected using a single chip for a reasonable t...
COCOON
2004
Springer
13 years 8 months ago
2004
Springer
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...