Multitape automata with symbol classes
Florent Nicart, Jean-Marc Champarnaud, Tibor Csaki, Tamas Gaal, Andre Kempe
We propose a new model of finite state machine: multi-tape automata with symbol classes and identity and non-identity constraints (in short MASCIN). This model generalizes both classical single or multi-tape machines, and machines with extended alphabet. We define this model in terms of a constraint satisfaction problem and discuss a problem occurring when projection is used on the model. Finally, we describe its implementation and results of a performance test.
11th International Conference on Implementation and Application of Automata, Taipei, Taiwan, 21-23 August, 2006.