Multi-tape automata with symbol classes

  • Authors:
  • F. Nicart;J. -M. Champarnaud;T. Csáki;T. Gaál;A. Kempe

  • Affiliations:
  • LLI–IRISA, ENSSAT, Lannion, France;LITIS (Université de Rouen), Saint Etienne du Rouvray, France;Xerox Research Centre Europe – Grenoble Laboratory, Meylan, France;Xerox Research Centre Europe – Grenoble Laboratory, Meylan, France;Xerox Research Centre Europe – Grenoble Laboratory, Meylan, France

  • Venue:
  • CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.