LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES

Rational relations are a powerful model used in many domains such as natural language processing. In this article, we propose a new model of finite state automata: multi-tape automata with symbol classes and identity or non-identity constraints. This model generalizes classical multi-tape automata, as well as automata and transducers with extended alphabet. We define this model in terms of a constraint satisfaction problem and discuss a problem occurring when handling the projection operation. Finally, we describe its implementation and results of a performance test.