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 ...