Sciweavers

COCOON
2004
Springer

Regular Expressions for Languages over Infinite Alphabets

13 years 7 months ago
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
Michael Kaminski, Tony Tan
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2004
Where COCOON
Authors Michael Kaminski, Tony Tan
Comments (0)