Regular Expressions for Languages over Infinite Alphabets.
Journal
Computing and Combinatorics, 10th Annual International Conference, COCOON 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings
Pages
171-178
Date Issued
2004
Author(s)
Kaminski, Michael
TONY TAN
Abstract
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 acceptable by finite-state unification based automaton - a model of computation that is tightly related to other models of automata over infinite alphabets. © Springer-Verlag Berlin Heidelberg 2004.
SDGs
Type
conference paper