Multi-tape Automata with Symbol Classes

  • F. Nicart
  • J. -M. Champarnaud
  • T. Csáki
  • T. Gaál
  • A. Kempe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4094)


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.


Constraint Satisfaction Problem Identity Relation Binary Constraint Symbol Class Symbol Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Publications, Palo Alto (2003)Google Scholar
  2. 2.
    Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press, San Diego (1974)MATHGoogle Scholar
  3. 3.
    Gaál, T.: Extended sequentializaton of transducers, pp. 569–585 (1999); Publicationes Mathematicae Debrecen, Supplement 60 (2002)Google Scholar
  4. 4.
    Gaál, T., Guingne, F., Nicart, F.: OTHER extension to finite state automata, vol. 65, pp. 535–552 (2002); Publicationes Mathematicae Debrecen, Supplement 65 (2005)Google Scholar
  5. 5.
    Giammarresi, D., Montalbano, R., Wood, D.: Block-deterministic regular languages. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 184–196. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Han, Y.-S., Wood, D.: The generalization of generalized automata: Expression automata. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 156–166. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Van Hentenryck, P.: Constraint satisfaction in logic programming. MIT Press, Cambridge (1989)Google Scholar
  8. 8.
    Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20(3), 331–378 (1994)Google Scholar
  9. 9.
    Karttunen, L.: The replace operator. In: Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, Boston, Massachusetts, pp. 16–23 (1995)Google Scholar
  10. 10.
    Kempe, A., Baeijs, C., Gaál, T., Guingne, F., Nicart, F.: WFSC - A new weighted finite state compiler. In: H. Ibarra, O., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 108–119. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  11. 11.
    Kempe, A., Champarnaud, J.-M., Eisner, J., Guingne, F., Nicart, F.: A class of rational n-WFSM auto-intersections. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 188–198. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Koskenniemi, K.: Two-level Morphology: A General Computational Model for Word-Form Recognition and Production, PhD thesis at the University of Helsinki, Department of General Linguistics (1983)Google Scholar
  13. 13.
    Nicart, F.: Conception de modèles génériques pour les machines à états finis, Thèse de doctorat de l’Université de Rouen (2005)Google Scholar
  14. 14.
    van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars 4(3), 263–286 (2001)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • F. Nicart
    • 1
    • 2
  • J. -M. Champarnaud
    • 2
  • T. Csáki
    • 3
    • 4
  • T. Gaál
    • 3
  • A. Kempe
    • 3
  1. 1.LLI–IRISA, ENSSATLannionFrance
  2. 2.LITIS (Université de Rouen)Saint Etienne du RouvrayFrance
  3. 3.Xerox Research Centre Europe – Grenoble LaboratoryMeylanFrance
  4. 4.Department of Computer ScienceInstitute of Mathematics and Informatics University of DebrecenDebrecenHungary

Personalised recommendations