Regular Expressions for Languages over Infinite Alphabets

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 it is accepted by finite-state unification based automaton

• Type: Conference
• Year: 2004
• Where: COCOON
• Authors: Michael Kaminski, Tony Tan
• Keywords: Alphabet Regular Expression, COCOON 2004, Combinatorics, Infinite Alphabets, Regular Expression